Automatic autoprojection of recursive equations with global variables and abstract data types

Science of Computer Programming

Volumn 16, Issue 2, 1991, Pages 151-195

  Bondorf, Anders ^a   Danvy, Olivier ^b  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b KANSAS STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY--PROGRAMMING THEORY; COMPUTER PROGRAMMING--AUTOMATIC OPERATION; MATHEMATICAL TECHNIQUES;

ABSTRACT DATA; AUTOPROJECTION; CALL UNFOLDING; GLOBAL VARIABLES; RECURSIVE EQUATIONS; SOURCE PROGRAMS;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0026218814     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6423(91)90002-F     Document Type: Article

References (41)

1. Towards a self-applicable partial evaluator for term rewriting systems
2. A self-applicable partial evaluator for term rewriting systems
3. Automatic autoprojection of higher order recursive equations
4. Compiling laziness by partial evaluation
5. Self-applicable partial evaluation (revised version)
6. Automatic autoprojection of recursive equations with global variables and abstract data types
7. Binding time analysis and the taming of self-application
8. Polyvariant mixed computation for analyzer programs
9. New insights into partial evaluation: the SCHISM experiment
10. Analyse de programmes, evaluation partielle et génération de compilateurs
11. Partial evaluation of pattern matching in strings
12. From interpreting to compiling binding times
13. Static and dynamic semantics processing
14. Semantics-directed compilation of nonlinear patterns
15. Mixed computation: potential applications and problems for study
16. Compiler generation by partial evaluation: a case study
17. A collecting interpretation of expressions (without powerdomains)
18. Abstract interpretation of first-order polymorphically typed languages
19. Automatic program specialization: a re-examination from basic principles
20. A self-applicable partial evaluator for the lambda calculus
21. An experiment in partial evaluation: the generation of a compiler generator
22. MIX: a self-applicable partial evaluator for experiments in compiler generation
23. Generating a pattern matching compiler by partial evaluation
24. Syntactic extensions in the programming language Lisp
25. Projection factorisations in partial evaluation
26. Preprocessing by specialization
27. Parameter splitting in a higher order functional language
28. Partially static structures in a self-applicable partial evaluator
29. Binding time aspects of partial evaluation
30. The use of action semantics
31. 3 on the algorithmic language scheme
32. A compiler generator produced by a self-applicable specialiser can have a surprisingly natural and understandable structure
33. Detecting global variables in denotational specifications
34. The structure of a self-applicable partial evaluator
35. The structure of a self-applicable partial evaluator
36. Automatic call unfolding in a partial evaluator
37. Replacing function parameters by global variables
38. Replacing function parameters by global variables
39. The concept of a supercompiler