Bazsites.com Functional Logic
Directory Topics
On the Web
- 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.
- 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.
- Functional Logic Programming - Michael Hanus's pages on amalgamating functional and logic programming.
- RELFUN - 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.
- 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.
- WFLP 2001 - International Workshop on Functional and (Constraint) Logic Programming, comprising the 10th International Workshop on Functional and Logic Programming and the 16th Workshop on Logic Programming. Kiel, Germany; 13--15 September 2001.
- HAL - Strongly typed, weakly moded, constraint-logic functional language designed to support construction, extension, and use of new constraint solvers.
- Escher - 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.
- Berlin, University of Technology - Department of Computer Science. Research interests include Computer graphics, computer vision, real time systems, robotics, computer architecture, logic design, data structures, functional and logic programming, scientific computing, communication, operating systems, neural networks, software engineering, theoretical computer science, formal specification, compiler construction, artificial intelligence, and knowledge based systems.
- Alpuente, Mar�a - Technical University of Valencia, Spain - Logic Programming: semantics, extensions and applications integration of functional and logic programming languages, abstract interpretation, program manipulation.
Wikipedia Articles
- Algebraic Logic Functional programming language - Algebraic Logic Functional programming language also known as ALF is a programming language which combines functional and logic programming techniques. Its foundation is Horn clause logic with equality which consists of predicates and Horn clauses for logic programming, and functions and equations for functional programming.
- Functional logic (business logic) abstraction - Functional Abstraction (or Business Logic Abstraction) is the ability to separate business logic implementation code from the service protocol implementation which is calling it.
- Business logic - Business logic is a non-technical term generally used to describe the functional algorithms which handle information exchange between a database and a user interface. There exists no definition of business logic in any programming language specification or API, nor in any academic research.
- Combinatory logic - Combinatory logic is a notation introduced by Moses Schönfinkel and Haskell Curry to eliminate the need for variables in mathematical logic. It has more recently been used in computer science as a theoretical model of computation and also as a basis for the design of functional programming languages.
- Many-sorted logic - Many-sorted logic can reflect formally our intention, not to handle the universe as a homogenous collection of objects, but to partition them in a way that is similar to types in typeful programming. Both functional and assertive “parts of speech” in the language of the logic reflect this typeful partitioning of the universe even on the syntax level: substitution and argument passing can be done only accordingly, respecting the “sorts”.