POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Use of Metasystem Transition in Theorem Proving and Program Optimization
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Semantic definitions in REFAL and the automatic production of compilers
Semantics-Directed Compiler Generation, Proceedings of a Workshop
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
A supercompiler system based on the language REFAL
ACM SIGPLAN Notices
The concept of a supercompiler
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
A bibliography on partial evaluation
ACM SIGPLAN Notices
Optimization of functional programs by grammar thinning
ACM Transactions on Programming Languages and Systems (TOPLAS)
Shortcut deforestation in calculational form
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Constraints to stop higher-order deforestation
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A practical turing machine representation
ACM SIGACT News
Introduction to Supercompilation
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
Listlessness is better than laziness: Lazy evaluation and garbage collection at compile-time
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
The essence of computation
An experiment in partial evaluation: the generation of a compiler generator
ACM SIGPLAN Notices
A Supercompiler for Core Haskell
Implementation and Application of Functional Languages
Higher-level supercompilation as a metasystem transition
Programming and Computing Software
| Hi-index | 0.00 |
In this paper we present and discuss some examples of the operation of the first experimental model of a supercompiler. We have chosen our examples to serve as “exhibits” which highlight most important features of the supercompiler and intimate its potential uses (this is reflected in section names). The acquaintance with REFAL is not assumed in this paper; our comments will be sufficient for a reader experienced in programming languages to understand REFAL programs (and almost to learn REFAL in the process).