Mode and termination checking for higher-order logic programs
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 296-310
- https://doi.org/10.1007/3-540-61055-3_44
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Natural semantics and some of its meta-theory in ElfPublished by Springer Nature ,2005
- Strict functionals for termination proofsPublished by Springer Nature ,1995
- On the occur-check-free PROLOG programsACM Transactions on Programming Languages and Systems, 1994
- Reasoning about Termination of Pure Prolog ProgramsInformation and Computation, 1993
- A framework for defining logicsJournal of the ACM, 1993
- Unification under a mixed prefixJournal of Symbolic Computation, 1992
- Abstract interpretation and application to logic programsThe Journal of Logic Programming, 1992
- Logic programming in the LF logical frameworkPublished by Cambridge University Press (CUP) ,1991
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple UnificationJournal of Logic and Computation, 1991
- Automatic mode inference for logic programsThe Journal of Logic Programming, 1988