From checking to inference via driving and dag grammars

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue , 2002, Pages 41-51

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

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Inference; Program inversion; Supercompilation

Indexed keywords

CONTEXT SENSITIVE GRAMMARS; FORMAL LANGUAGES; INFERENCE ENGINES; LOGIC PROGRAMMING; PROGRAM COMPILERS; SEMANTICS; TREES (MATHEMATICS);

DAG GRAMMARS; DRIVING GRAMMARS; FINITE GRAMMAR; FUNCTIONAL PROGRAMS; PROGRAM INVERSION;

PROGRAM DIAGNOSTICS;

EID: 0036037642     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/503032.503036     Document Type: Conference Paper

References (15)

1. The universal resolving algorithm: Inverse computation in a functional language
2. Graph expressions and graph rewritings
3. Occam's razor in metacomputation: The notion of a perfect process tree
4. A roadmap to metacomputation by supercompilation
5. Flow analysis of lazy higher-order functional programs
6. An algorithm for optimal lambda calculus reduction
7. The size-change principle for program termination
8. The generation of inverse functions in Refal
9. Inversion and metacomputation
10. On perfect supercompilation
11. A grammar-based data-flow analysis to stop deforestation
12. Introduction to supercompilation
13. Convergence of program transformers in the metric space of trees
14. Semantic definitions in Refal and the automatic production of compilers