This article describes theoretical and practical aspects of an implemented self-applicable partial evaluator for the untyped lambda-calculus with constants ... compilers from a denotational or interpretive specification of a programming languageJFP, 1(1):21-69, 1991.
This paper explains ... of untyped Racket. Furthermore, modules in this typed language can safely exchange values with untyped modules. Last but not least, the implementation includesIn Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation. 2011: 132-141
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions ... languages. Compilation is staged and includes standard phases like translationPOPL 2010: 93-106
We have designed and implemented a program-generator generator (PGG) for an untyped higher-order functional programming language. The program generators perform continuation-based multi-level offline specialization and thus combineICFP 1996: 180-189
We have solved the problem of constructing a fully automatic online program specializer for an untyped functional language (specifically, the functional ... programming language. Producing graphs rather than program text solves problemsfpca 1991: 165-191
Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recentACM Comput. Surv., 17(4):471-522, 1985.