The relation between logic and functional languages: a survey

DOI10.1016/0743-1066(86)90014-2zbMath0599.68014OpenAlexW2013076094MaRDI QIDQ3735058

Giorgio Levi, Marco Bellia

Publication date: 1986

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(86)90014-2

zbMATH Keywords

completionlazy evaluationconcurrencynarrowingset abstractionSLD-resolution of equational formulas

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (14)

Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction ⋮ Logic programming with external procedures: Introducing S-unification ⋮ Incremental constraint satisfaction for equational logic programming ⋮ Equation solving in conditional AC-theories ⋮ Lazy narrowing in a graph machine ⋮ On completeness of narrowing strategies ⋮ A rationale for conditional equational programming ⋮ Conditional equational theories and complete sets of transformations ⋮ Logic and functional programming by retractions ⋮ Dynamic detection of determinism in functional logic languages ⋮ Relating the implementation techniques of functional and functional logic languages ⋮ C-expressions: A variable-free calculus for equational logic programming ⋮ A domain-theoretic approach to functional and logic programming ⋮ Accumulators: New logic variable abstractions for functional languages

This page was built for publication: The relation between logic and functional languages: a survey