Proving termination properties of prolog programs: A semantic approach
- 31 October 1992
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 14 (1-2), 1-29
- https://doi.org/10.1016/0743-1066(92)90045-5
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Comparative semantics for prolog with cutScience of Computer Programming, 1990
- Studies in Pure Prolog: TerminationPublished by Springer Nature ,1990
- Semantics for Prolog via term rewrite systemsLecture Notes in Computer Science, 1988
- Operational and denotational semantics of prologThe Journal of Logic Programming, 1987
- Recursive Programs as Definitions in First-Order LogicSIAM Journal on Computing, 1984
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- First order programming logicPublished by Association for Computing Machinery (ACM) ,1979
- Recursive programs as functions in a first order theoryLecture Notes in Computer Science, 1979
- A Computational LogicPublished by Elsevier ,1979
- Proving Theorems about LISP FunctionsJournal of the ACM, 1975