Submit a site
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:
- 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.
- Operational semantics based on lazy narrowing; provides some higher-order features.
- 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.
- Declarative, general-purpose language, merges best features of functional and logic languages. Has types and modules, higher-order and meta-programming 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.
- 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 object-oriented programming. Formally, it is an instance (or composition of 3 instances) of constraint logic programming.
- 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.
- 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.
- Subset-Equational 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.
Help build the largest human-edited directory on the web.
Submit a Site
Open Directory Project
Become an Editor