1987 · 62 citations · 13 references
ComputingComputer ScienceLogicProgramming LanguagesTheory Of ComputationAutomated ReasoningFunctional ProgrammingLogic ProgrammingLogical DeductionMutual ExclusionUnification
Abstract † We introduce a new paradigm for the integration of functional and logic programming. Unlike most current research, our approach is not based on extending unification to general-purpose equation solving. Rather, we propose a computation delaying mechanism called residuation. This allows a clear distinction between functional evaluation and logical deduction. The former is based on the λ-calculus, and the latter on Horn clause resolution. In clear contrast with equation-solving approaches, our model supports higher-order function evaluation and efficient compilation of both functional and logic programming expressions, without being plagued by non-deterministic term-rewriting. In addition, residuation lends itself naturally to process synchronization and constrained search. Besides unification (equations), other residuations may be any ground-decidable goal, such as mutual exclusion (inequations), and comparisons (inequalities). We describe an implementation of the residuation paradigm as a prototype language called Le Fun—Logic, equations, and Functions.
13
A formulation of the simple theory of types
Alonzo Church · Journal of Symbolic Logic · 1940 · 1.9K citations
A survey of the project Automath
de Ng Dick Bruijn · Data Archiving and Networked Services (DANS) · 1980 · 258 citations · Full text
A framework for defining logics
Robert Harper, Furio Honsell, Gordon Plotkin · Journal of the ACM · 1993 · 195 citations · Full text
What is a model of the lambda calculus?
Albert R. Meyer · Information and Control · 1982 · 166 citations