Uniform proofs as a foundation for logic programming
Open Access
- 1 March 1991
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 51 (1-2) , 125-157
- https://doi.org/10.1016/0168-0072(91)90068-w
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Specifying theorem provers in a higher-order logic programming languagePublished by Springer Nature ,2005
- A logical analysis of modules in logic programmingThe Journal of Logic Programming, 1989
- HORNLOG: A graph-based interpreter for general Horn clausesThe Journal of Logic Programming, 1987
- Natural deduction as higher-order resolutionThe Journal of Logic Programming, 1986
- A kripke-kleene semantics for logic programs*The Journal of Logic Programming, 1985
- N-Prolog: An extension of Prolog with hypothetical implications. I.The Journal of Logic Programming, 1984
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976
- Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systemsThe Journal of Symbolic Logic, 1960
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940