Using domain algebras to prove the correctness of a compiler
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Two-level semantics and code generation
Theoretical Computer Science - First European Symposium on Programming, Saarbru:9Aicken, W. Germany, March 17:8
Using projection analysis of evaluation-order and its application
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Context information for lazy code generation
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
From operational semantics to abstract machines: preliminary results
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Compilation of functional languages by program transformation
ACM Transactions on Programming Languages and Systems (TOPLAS)
The evaluation transformer model of reduction and its correctness
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Advances in distributed computing (ADC) and colloquium on combining paradigms for software development (CCPSD): Vol. 2
Lazy functional languages: abstract interpretation and compilation
Lazy functional languages: abstract interpretation and compilation
Two-level functional languages
Two-level functional languages
Higher-order strictness analysis in untyped lambda calculus
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Advice on structuring compilers and proving them correct
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Definable Operation in General Algebras, and the Theory of Automata and Flowcharts
Programming Languages and Their Definition - Hans Bekic (1936-1982)
Proceedings of the REX Workshop on Sematics: Foundations and Applications
| Hi-index | 0.00 |
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictness analysis we are able to define a code generation which avoids delaying the evaluation of the argument to an application, provided that the corresponding function is strict.To show the correctness of the code generation, we will adopt the framework of logical relations and define a layer of predicates which finally will ensure that the code generation is correct with respect to the standard semantics.