A survey of GCLA: a definitional approach to logic programming

DOI10.1007/BFB0038692MaRDI QIDQ5053005zbMATH OpenFDO

Authors Martin Aronsson, Lars-Henrik Eriksson, Lars Hallnäs, Per Kreuger

Publication date 26 November 2022

Published in Extensions of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0038692

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic programming (68N17) Logic in computer science (03B70)

Recommendations

• Extensions of logic programming. International workshop, Tübingen, FRG, 8--10 December 1989. Proceedings
• A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules
• A Proof-Theoretic Approach to Logic Programming
• Higher-order Horn clauses
• Uniform proofs as a foundation for logic programming

Cited in

(2)

• On GCLA, Gisela, and MedView. Studies in declarative programming with application to clinical medicine
• Program development schemata as derived rules

This page was built for publication: A survey of GCLA: a definitional approach to logic programming

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