Extended unification algorithms for the integration of functional programming into logic programming

DOI10.1016/0743-1066(87)90002-1zbMath0623.68006OpenAlexW1981269662MaRDI QIDQ3761667

Pascal Van Hentenryck, Mehmet Dincbas

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0743-1066(87)90002-1

zbMATH Keywords

evaluationefficiencycompletenessterminationderivationprocedural semanticscoroutininghandling of infinite data structuressurderivation

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (9)

An universal termination condition for solving goals in equational languages ⋮ Unification modulo an equality theory for equational logic programming ⋮ Incremental constraint satisfaction for equational logic programming ⋮ Enumerating outer narrowing derivations for constructor-based term rewriting systems ⋮ How efficient is a global constraint in practice? A fair experimental framework ⋮ A logic language for combinatorial optimization ⋮ Interval propagation to reason about sets: Definition and implementation of a practical language ⋮ Lazy Constraint Imposing for Improving the Path Constraint ⋮ Symbolic constraint handling through unification in finite algebras

This page was built for publication: Extended unification algorithms for the integration of functional programming into logic programming