Share This Author
A Syntactic Approach to Type Soundness
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.
Contracts for higher-order functions
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.).
The essence of compiling with continuations
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.
Semantics Engineering with PLT Redex
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.
Classes and mixins
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.
The design and implementation of typed scheme
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.
The Revised Report on the Syntactic Theories of Sequential Control and State
The theory and practice of first-class prompts
- M. Felleisen
- Computer SciencePOPL '88
- 13 January 1988
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.
On the Expressive Power of Programming Languages
- M. Felleisen
- Computer ScienceESOP
- 1 May 1990
A formal notion of expressiveness is developed and its properties are investigated to demonstrate the theory's closeness to published intuitions on expressiveness, and the expressive power of several extensions of functional languages is analyzed.
How to design programs: an introduction to programming and computing
This introduction to programming places computer science in the core of a liberal arts education and focuses on the program design process, which fosters a variety of skills -- critical reading, analytical thinking, creative synthesis, and attention to detail -- that are important for everyone, not just future computer programmers.