English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  A Needed Narrowing Strategy

Antoy, S., Echahed, R., & Hanus, M. (1994). A Needed Narrowing Strategy. In Proceedings of the 21st ACM Symposium on Principles of Programming Languages (POPL'94) (pp. 268-279). New York, USA: ACM.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Antoy, Sergio, Author
Echahed, Rachid, Author
Hanus, Michael1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: Narrowing is the operational principle of languages that integrate functional and logic programming. We propose a notion of a needed narrowing step that, for inductively sequential rewrite systems, extends the Huet and Levy notion of a needed reduction step. We define a strategy, based on this notion, that computes only needed narrowing steps. Our strategy is sound and complete for a large class of rewrite systems, is optimal w.r.t. the cost measure that counts the number of distinct steps of a derivation, computes only independent unifiers, and is efficiently implemented by pattern matching.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121994
 Publication Status: Issued
 Pages: -
 Publishing info: New York, USA : ACM
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519529
Other: Local-ID: C1256104005ECAFC-62AE0D6224F5F524C12561440062210B-AntoyEchahedHanus94a
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Portland, USA
Start-/End Date: 1994

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 21st ACM Symposium on Principles of Programming Languages (POPL'94)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 268 - 279 Identifier: -