The functional logic language BABEL and its implementation on a graph machine

The first-order, untyped, functional logic language Babel is extended by polymorphic types and higher order functions. A sophisticated incompatibility check which is used to guarantee nonambiguity of BABEL programs is presented. For the implementation of the language, unification and backtracking ar...

Full description

Saved in:
Bibliographic Details
Published in:New generation computing 1996-01, Vol.14 (4), p.391-427
Main Authors: KUCHEN, H, LOOGEN, R, MORENO-NAVARRO, J. J, RODRIGUEZ-ARTALEJO, M
Format: Article
Language:English
Subjects:
Applied sciences
Artificial intelligence
Automata. Abstract machines. Turing machines
Computer science
control theory
systems
Exact sciences and technology
Learning and adaptive systems
Programming languages
Software
Theoretical computing
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The first-order, untyped, functional logic language Babel is extended by polymorphic types and higher order functions. A sophisticated incompatibility check which is used to guarantee nonambiguity of BABEL programs is presented. For the implementation of the language, unification and backtracking are integrated in a programmed (functional) graph reduction machine. The implementation of this machine has been used for a comparison between Babel and PROLOG based on the runtimes of some example programs.
ISSN:0288-3635
1882-7055
DOI:10.1007/BF03037211