On perfect supercompilation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1755, Issue , 2000, Pages 113-127

  Secher, Jens Peter ^a   Sørensen, Morten Heine ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

GENERALISATION; PERFECT INFORMATIONS; REWRITE SYSTEMS;

INFORMATION DISSEMINATION;

EID: 84943247017     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46562-6_10     Document Type: Conference Paper

References (23)

1. ACM. Proceeding of the ACM SIGPLAN Syposium on Partial Evaluation and Semantics-Based Program Manipulation, volume 26(9) of ACM SIGPLAN No-tices, New York, September 1991. ACM Press.
2. Equational problems and disunification
3. Partial evaluation of pattern matching in strings
4. Generalized partial computation
5. Occam's razor in metacomputation: The notion of a perfect process tree
6. Extending the power of automatic constraint-based partial evaluators
7. Controlling generalization and polyvariance in partial deduction of normal logic programs
8. Fast decision procedures based on congruence closure
9. Convergence of program transformers in the metric space of trees
10. Introduction to supercompilation
11. Generalized partial computation using disunification to solve constraints
12. The concept of a supercompiler
13. Deforestation: Transforming programs to eliminate intermediate trees