PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
A logical analysis of modules in logic programming
Journal of Logic Programming
A transformational approach to negation in logic programming
Journal of Logic Programming
LO and behold! Concurrent structured processes
OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
A logic programming language with Lambda-abstraction, function variables, and simple unification
Proceedings of the international workshop on Extensions of logic programming
A framework for defining logics
Journal of the ACM (JACM)
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Abstract interpretation of linear logic programming
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Proof theoretic approach to specification languages
Proof theoretic approach to specification languages
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Proof-theoretic foundation of compilation in logic programming languages
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Efficient resource management for linear logic proof search
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Correspondences between classical, intuitionistic and uniform provability
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Proofs as computations in linear logic
Theoretical Computer Science
Minimal Negation and Hereditary Harrop Formulae
TVER '92 Proceedings of the Second International Symposium on Logical Foundations of Computer Science
The Metalanguage lambda-Prolog and Its Implementation
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
A Proposal for Modules in Lambda-Prolog
ELP '93 Proceedings of the 4th International Workshop on Extensions of Logic Programming
Efficient Resource Management for Linear Logic Proof Search
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
Elimination of Negation in a Logical Framework
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
System Description: Twelf - A Meta-Logical Framework for Deductive Systems
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Linear higher-order pre-unification
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Type-driven natural language analysis
Type-driven natural language analysis
Automating the meta theory of deductive systems
Automating the meta theory of deductive systems
An effective fixpoint semantics for linear logic programs
Theory and Practice of Logic Programming
Model checking linear logic specifications
Theory and Practice of Logic Programming
Monadic concurrent linear logic programming
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Mechanizing metatheory in a logical framework
Journal of Functional Programming
Specifying Properties of Concurrent Computations in CLF
Electronic Notes in Theoretical Computer Science (ENTCS)
A Logical Characterization of Forward and Backward Chaining in the Inverse Method
Journal of Automated Reasoning
The Bedwyr System for Model Checking over Syntactic Expressions
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
The Abella Interactive Theorem Prover (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Focusing and polarization in linear, intuitionistic, and classical logics
Theoretical Computer Science
Multi-level meta-reasoning with higher-order abstract syntax
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Theoretical foundations and semantics of logic programming
A 25-year perspective on logic programming
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Concurrent and reactive constraint programming
A 25-year perspective on logic programming
25 years of applications of logic programming in Italy
A 25-year perspective on logic programming
| Hi-index | 0.00 |
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.