A hybrid approach to online and offline partial evaluation

Higher-Order and Symbolic Computation

Volumn 14, Issue 2-3, 2001, Pages 101-142

  Sumii, Eijiro ^a   Kobayashi, Naoki ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Binding time analysis; Cogen approach; Online partial evaluation; State based let insertion

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; ONLINE SYSTEMS; PROGRAM DIAGNOSTICS; SEMANTICS; SOFTWARE ENGINEERING;

BINDING TIME ANALYSIS; CALL BY VALUE FUNCTIONAL LANGUAGE; COGEN APPROACH; OFFLINE PARTIAL EVALUATION; ONLINE PARTIAL EVALUATION; PROGRAM TRANSFORMATION; STATE BASED LET INSERTION;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 0035466055     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1012984529382     Document Type: Article

References (44)

1. An empirical and analytic study of stack vs. Heap cost for languages with closures
2. Binding-time analysis for both static and dynamic expressions
3. The effectiveness of flow analysis for inlining
4. An inverse of the evaluation functional for typed lambda-calculus
5. Relational interpretations of recursive types in an operational setting
6. Partial evaluation of standard ML
7. Self-applicable partial evaluation
8. Improving binding times without explicit CPS-conversion
9. Automatic autoprojection of recursive equations with global variables and abstract data types
10. Soft typing
11. Polyvariant binding-time analysis for applicative languages
12. Tutorial notes on partial evaluation
13. Type-directed partial evaluation
14. Online type-directed partial evaluation
15. Type-directed partial evaluation
16. A functional abstraction of typed contexts
17. Abstracting control
18. Representing monads
19. Controlling effects
20. Normalization by evaluation for the computational lambda-calculus
21. Partial evaluation of computation process-an approach to a compiler-compiler
22. A computational formalization for partial evaluation (extended version)
23. Efficient type inference for higher-order binding-time analysis
24. Polymorphic binding-time analysis
25. A self-applicable partial evaluator for the lambda calculus
26. Type-based useless variable elimination
27. A strongly-typed self-applicable partial evaluator
28. Continuation-based partial evaluation
29. Sound specialization in the presence of computational effects
30. The polyadic π-calculus: A tutorial
31. Notions of computation and monads
32. Higher-order abstract syntax
33. Topics in online partial evaluation
34. Self-applicable online partial evaluation
35. Online type-directed partial evaluation for dynamically-typed languages
36. The type and effect discipline
37. Combinators for program generation
38. Partial evaluation for higher-order languages with state
39. Once upon a type
40. Deforestation: Transforming programs to eliminate trees
41. Encoding types in ML-like languages