whatUseek Collection Sites (submit a site ):
Give your site great
placement in this category in as little as two business days!
whatUseek Directory Site Listings:
ALF  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.
BABEL  Operational semantics based on lazy narrowing; provides some higherorder features.
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.
Escher  Declarative, generalpurpose language, merges best features of functional and logic languages. Has types and modules, higherorder and metaprogramming facilities, declarative input/output. Set of system modules provides many operations on standard data types: integers, lists, characters, strings, sets, programs.
Functional Logic Programming  Michael Hanus's pages on amalgamating functional and logic programming.
LIFE  Logic, Inheritance, Functions, Equations: experimental language merging 3 orthogonal programming paradigms useful in symbolic computing. For programming, it is a language resembling logic, functional, and objectoriented programming. Formally, it is an instance (or composition of 3 instances) of constraint logic programming.
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 SLDresolution merged with innermost narrowing.
RELFUN  RelationalFunctional Language: logicprogramming language with callbyvalue (eager) expressions of nondeterministic, nonground functions; clauses are Hornish, succeeding with true(s), or footed, returning any value(s), and define operations (relations, functions) allowing (applyreducible) higherorder syntax with arbitrary terms (constants, structures, variables) as operators.
SEL  SubsetEquational Language: functional programming language based on equational and subset program clauses, with strict semantics, weak typing. Goal: declarative and efficient set processing compatible with functional and logic programming. Provides ability to define transitive closures through circular constraints. FTP site.
