Multiple specialization using minimal-function graph semantics
- 1 July 1992
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 13 (2-3) , 259-290
- https://doi.org/10.1016/0743-1066(92)90033-y
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Automatic mode inference for logic programsThe Journal of Logic Programming, 1988
- Specialisation of Prolog and FCP programs using abstract interpretationNew Generation Computing, 1988
- A semantic model of reference counting and its abstraction (detailed summary)Published by Association for Computing Machinery (ACM) ,1986
- Abstract interpretation of Prolog programsLecture Notes in Computer Science, 1986
- An application of abstract interpretation of logic programs: Occur check reductionPublished by Springer Nature ,1986
- Higher-order strictness analysis in untyped lambda calculusPublished by Association for Computing Machinery (ACM) ,1986
- The occur-check problem in PrologNew Generation Computing, 1984
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977