Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Arity raiser and use in program specialization
Proceedings of the third European symposium on programming on ESOP '90
Techniques for partial evaluation of imperative languages
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Automatic autoprojection of recursive equations with global variable and abstract data types
Science of Computer Programming
A strongly-typed self-applicable partial evaluator
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Automatic online partial evaluation
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Two-level functional languages
Two-level functional languages
Automatic autoprojection of higher order recursive equations
ESOP '90 Selected papers from the symposium on 3rd European symposium on programming
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
PEPM '93 ACM Symposium on Partial Evaluation
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A generic account of continuation-passing styles
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Building interpreters by composing monads
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Polyvariant constructor specialisation
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Lisp and Symbolic Computation - Special issue on state in programming languages (part I)
A general approach for run-time specialization and its application to C
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Selected Papers from the Internaltional Seminar on Partial Evaluation
Selected Papers from the Internaltional Seminar on Partial Evaluation
Removing Value Encoding Using Alternative Values in Partial Evaluation of Strongly-Typed Languages
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Hand-Writing Program Generator Generators
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Practical Aspects of Specialization of Algol-like Programs
Selected Papers from the Internaltional Seminar on Partial Evaluation
Selected Papers from the Internaltional Seminar on Partial Evaluation
Foundations for partial evaluation of functional programs with computational effects
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
CPS Translations and Applications: The Cube and Beyond
Higher-Order and Symbolic Computation
The Correctness of Type Specialisation
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
An Introduction to Online and Offline Partial Evaluation using a Simple Flowchart Language
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
A Type Specialisation Tutorial
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
A monadic approach for avoiding code duplication when staging memoized functions
Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Tagging, encoding, and jones optimality
ESOP'03 Proceedings of the 12th European conference on Programming
| Hi-index | 0.00 |
We extend type specialisation to a computational lambda calculus with first-class references. The resulting specialiser has been used to specialise a self-interpreter for this typed computational lambda calculus optimally. Furthermore, this specialiser can perform operations on references at specialisation time, when possible.