• Publications
  • Influence
A Syntactic Approach to Type Soundness
TLDR
A new approach to proving type soundness for Hindley/Milner-style polymorphic type systems by an adaptation of subject reduction theorems from combinatory logic to programming languages and the use of rewriting techniques for the specification of the language semantics is presented. Expand
Contracts for higher-order functions
TLDR
This paper introduces λcon, a typed lambda calculus with assertions for higher-order functions, which models the assertion monitoring system that is employed in DrScheme and establishes basic properties of the model (type soundness, etc.). Expand
The essence of compiling with continuations
TLDR
The combined effect of the three phases is equivalent to a source-to-source transformation that simulates the compaction phase and fully developed CPS compilers do not need to employ the CPS transformation but can achieve the same results with a simple source-level transformation. Expand
Semantics Engineering with PLT Redex
TLDR
This text is the first comprehensive presentation of reduction semantics in one volume and introduces the first reliable and easy-to-use tool set for such forms of semantics, and presents a framework for the formulation of language models as PLT Redex models. Expand
The design and implementation of typed scheme
TLDR
Initial experiments with the implementation suggest that Typed Scheme naturally accommodates the programming style of the underlying scripting language, at least for the first few thousand lines of ported code. Expand
A call-by-need lambda calculus
TLDR
This paper derives an equational characterization of call-by-need and proves it correct with respect to the original lambda calculus and is a strictly smaller theory than the lambda calculus. Expand
Classes and mixins
TLDR
A model of class-to-class functions that refers to as mixins is developed, which is an intuitive model of an essential Java subset; an extension that explains and models mixins; and type soundness theorems for these languages. Expand
The Revised Report on the Syntactic Theories of Sequential Control and State
TLDR
This paper develops fully compatible equational theories of the same imperative higher-order programming languages that subsume the original calculi of control and state and satisfy the usual Church–Rosser and Standardization Theorems. Expand
The theory and practice of first-class prompts
TLDR
With the introduction of prompt-applications, the control calculus becomes a traditional calculus all of whose equations imply operational equivalence and enhance the expressiveness and efficiency of the language. Expand
...
1
2
3
4
5
...