Paper Info
Title
From reduction machines to narrowing machines
Abstract
Narrowing, the evaluation mechanism of functional logic languages, can be seen as a generalizationof reduction, the evaluation mechanism of purely functional languages. The unidirectionalpattern matching, which is used for parameter passing in functional languages, is simplyreplaced by the bidirectional unification known from logic programming languages. We showin this paper, how to extend a reduction machine, that has been designed for the evaluation ofpurely functional programs to a...
Year
DOI
Venue
1991
10.1007/3540539816_80
TAPSOFT, Vol.1
Keywords
Field
DocType
reduction machine,reduction machines,functional language,functional programming
Functional logic programming,Programming language,Functional programming,Nondeterministic algorithm,Programming paradigm,Computer science,Theoretical computer science,Prolog,Logic programming,Backtracking,Abstract machine
Conference
Volume
ISSN
ISBN
494
0302-9743
0-387-53981-6
Citations 
PageRank 
References 
19
1.59
9
Authors
1
Name
Order
Citations
PageRank
Rita Loogen159842.21