BTA Algorithms to ensure termination of off-line partial evaluation
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 273-284
- https://doi.org/10.1007/3-540-62064-8_23
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Natural semanticsPublished by Springer Nature ,2005
- Global control for partial deduction through characteristic atoms and global treesPublished by Springer Nature ,1996
- What not to do when writing an interpreter for specialisationPublished by Springer Nature ,1996
- Ensuring Global Termination of Partial Deduction While Allowing Flexible PolyvariancePublished by MIT Press ,1995
- Partial evaluation in logic programmingThe Journal of Logic Programming, 1991
- Mixed computation: potential applications and problems for studyTheoretical Computer Science, 1982