An improved extensionality criterion for higher-order logic programs

DOI10.1007/3-540-44802-0_15MaRDI QIDQ4783309zbMATH OpenFDO

Authors Marc Bezem

Publication date 4 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2142/21420203

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• The intricacies of three-valued extensional semantics for higher-order logic programs

Cited in

(7)

• Extending Horn clause logic with implication goals
• Refinement of Higher-Order Logic Programs
• The intricacies of three-valued extensional semantics for higher-order logic programs
• Equivalence of two fixed-point semantics for definitional higher-order logic programs
• In praise of impredicativity: a contribution to the formalization of meta-programming
• Equivalence of two fixed-point semantics for definitional higher-order logic programs
• A Survey of the Proof-Theoretic Foundations of Logic Programming

This page was built for publication: An improved extensionality criterion for higher-order logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4783309)