Proof-Theoretic and Higher-Order Extensions of Logic Programming

10 years 8 months ago
Proof-Theoretic and Higher-Order Extensions of Logic Programming
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstraction mechanisms such as higher-order programming, scoping constructs and forms of information hiding. Those extensions were based on the Deduction and Computation paradigm as formulated in Miller et al’s approach [51], which built logic programming around the notion of focused uniform proofs The Italian contribution has been both foundational and applicative, in terms of language extensions, implementation techniques and usage of the new features to capture various computation models. We argue that the emphasis has now moved to the theory and practice of logical frameworks, carrying with it a better understanding of the foundations of proof search.
Alberto Momigliano, Mario Ornaghi
Added 10 Jul 2010
Updated 10 Jul 2010
Type Conference
Year 2010
Where AGP
Authors Alberto Momigliano, Mario Ornaghi
Comments (0)