Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
Higher-order unification revisited: Complete sets of transformations
Journal of Symbolic Computation
Deforestation: transforming programs to eliminate trees
Proceedings of the Second European Symposium on Programming
Graph-based implementation of a functional logic language
Proceedings of the third European symposium on programming on ESOP '90
Report on the programming language Haskell: a non-strict, purely functional language version 1.2
ACM SIGPLAN Notices - Haskell special issue
Logic programming with functions and predicates: the language Babel
Journal of Logic Programming
A logic programming approach to implementing higher-order term rewriting
ELP'91 Conference Proceedings on Extensions of logic programming
Higher-order unification via combinators
Theoretical Computer Science
Dynamic detection of determinism in functional logic languages
PLILP '91 Selected papers of the symposium on Programming language implementation and logic programming
On the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming
CSL '92 Selected Papers from the Workshop on Computer Science Logic
Higher Order Babel: Language and Implementation
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
| Hi-index | 0.00 |
Functional logic languageshave a syntax like a purely functional language but use narrowing as operational semantics. We present the functional logic language Higher Order Babel which provides higher order unification for parameter passing and solving equations. When searching for a function which solves an equation "polynomial functions" as well as defined functions are taken into account. In contrast to all other programming languages with higher order unification HO-Babel replaces the expensive β-reduction by the more efficient combinator reduction. Further, HOBabel is more homogeneous since it does not distinguish functions which only represent data structures and defined function which have access to the full execution mechanismof the language.