Equality, types, modules, and (why not?) generics for logic programming

DOI10.1016/0743-1066(84)90004-9zbMath0592.68076OpenAlexW2034034435WikidataQ127360529 ScholiaQ127360529MaRDI QIDQ5903118

Joseph A. Guguen, José Meseguer

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0743-1066(84)90004-9

zbMATH Keywords

sortsEqlogextension of Prologpreprogrammed sets of Horn clauses

Mathematics Subject Classification ID

Theory of software (68N99)

Related Items (7)

FPL : Functional plus logic programming an integration of the FP and Prolog languages ⋮ Compiling concurrent rewriting onto the Rewrite Rule Machine ⋮ Rewrite method for theorem proving in first order theory with equality ⋮ A typed functional extension of logic programming ⋮ A hidden agenda ⋮ Logical foundations of CafeOBJ ⋮ Contextual rewriting as a sound and complete proof method for conditional LOG-specifications

This page was built for publication: Equality, types, modules, and (why not?) generics for logic programming