ftp://ftp.imag.fr/pub/labo-LSR/SCOP/LPG/ - ftp://ftp.imag.fr/pub/labo-LSR/SCOP/LPG/
Generic functional logic language: functions defined by conditional rewrite rules, predicates defined by Horn clauses whose bodies may contain equations, disequations, or classical atomic formulae. Extant version uses extension of SLD-resolution merged with innermost narrowing. |
Functional Logic Programming - http://www.informatik.uni-kiel.de/~mh/FLP/
Michael Hanus's pages on amalgamating functional and logic programming. |
http://www-i2.informatik.rwth-aachen.de/Research/BABEL/ - http://www-i2.informatik.rwth-aachen.de/Research/BABEL/
Operational semantics based on lazy narrowing; provides some higher-order features. |
http://www.csse.monash.edu.au/~mbanda/hal/ - http://www.csse.monash.edu.au/~mbanda/hal/
Strongly typed, weakly moded, constraint-logic functional language designed to support construction, extension, and use of new constraint solvers. |
http://www.dfki.uni-kl.de/~vega/relfun.html - http://www.dfki.uni-kl.de/~vega/relfun.html
Relational-Functional Language: logic-programming language with call-by-value (eager) expressions of non-deterministic, non-ground functions; clauses are Hornish, succeeding with true(s), or footed, returning any value(s), and define operations (relations, functions) allowing (apply-reducible) higher-order syntax with arbitrary terms (constants, structures, variables) as operators. |
http://www.informatik.uni-kiel.de/~curry/ - http://www.informatik.uni-kiel.de/~curry/
Multiparadigm declarative programming language seamlessly merges functional, logic, and concurrent programming paradigms; covers the most important operational principles in the area of integrated functional logic languages. |
http://www.informatik.uni-kiel.de/~mh/systems/ALF.html - http://www.informatik.uni-kiel.de/~mh/systems/ALF.html
Foundation: Horn clause logic with equality which consists of predicates and Horn clauses for logic programming, and functions and equations for functional programming. A full integration of both programming models, so any functional expression can be used in a goal literal and arbitrary predicates can occur in conditions of equations. |