A Tutorial on Proof Theoretic Foundations of Logic Programming

A Tutorial on Proof Theoretic Foundations of Logic Programming (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Paola Bruscoli , Alessio Guglielmi , Technische Universität Dresden

Citations:

1 - 0 self

BibTeX

@MISC{Bruscoli03atutorial,
    author = {Paola Bruscoli and Alessio Guglielmi and Technische Universität Dresden},
    title = {A Tutorial on Proof Theoretic Foundations of Logic Programming},
    year = {2003}
}

Bookmark

OpenURL

Abstract

Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expressive logic programming languages, endowed with a rich meta theory.

Citations

334	Uniform proofs as a foundation for logic programming - Miller, Nadathur, et al. - 1991
209	Investigations into logical deduction - Gentzen - 1969
84	Forum: A Multiple-Conclusion Meta-Logic - Miller - 1996
75	Forum: A multiple-conclusion specification logic - Miller - 1996
54	Higher-order horn clauses - Nadathur, Miller - 1990
52	Constructive logics part I: A tutorial on proof systems and typed λ-calculi. Theoretical computer science - Gallier - 1993
6	An overview of lambda-prolog - Nadathur, Miller - 1988
1	Overview of linear logic programming. Accepted as a chapter for a book on linear logic, edited by - Miller