The functional logic language BABEL and its implementation on a graph machine
| Autor: | Mario Rodríguez-Artalejo, Herbert Kuchen, Rita Loogen, Juan José Moreno-Navarro |
|---|---|
| Rok vydání: | 1996 |
| Předmět: |
Functional programming
Unification Computer Networks and Communications Programming language Computer science computer.software_genre Abstract machine Theoretical Computer Science First-order logic Prolog TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Hardware and Architecture TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Graph reduction Graph (abstract data type) computer Software Logic programming computer.programming_language |
| Zdroj: | New Generation Computing. 14:391-427 |
| ISSN: | 1882-7055 0288-3635 |
| DOI: | 10.1007/bf03037211 |
| Popis: | The first-order, untyped, functional logic language Babel is extended by polymorphic types and higher order functios. 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink