A Functional Logic Language Based on Higher Order Narrowing

Abstract

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, HO-Babel 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.

Conference

Publication date: July 1995

Publication date (Print): July 1995

Pages: 1-9

Affiliations

RWTH Aachen, Lehrstuhl für Informatik II

D-52056 Aachen, Germany

Article

DOI: 10.14236/ewic/FP1995.12

Copyright statement: © Herbert Kuchen. Published by BCS Learning and Development Ltd. Proceedings of the 1995 Glasgow Workshop on Functional Programming, Ullapool, Scotland

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: Proceedings of the 1995 Glasgow Workshop on Functional Programming

Conference acronym: FP

Conference number:

Conference location: Ullapool, Scotland

Conference date: 10-12 July 1995

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: Functional Programming

Product

Product Information: 1477-9358BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/FP1995.12

Self URI (journal page): https://ewic.bcs.org/

Categories

Series title: Electronic Workshops in Computing