We introduce MetaML, a practically motivated, statically typed multi-stage programming
language. MetaML is a “real” language. We have built an implementation and used it to …

We have built the first family of tagless interpretations for a higher-order typed object
language in a typed metalanguage (Haskell or ML) that require no dependent types …

We introduce MetaML, a statically-typed multi-stage programming language extending
Nielson and Nielson's two stage notation to an arbitrary number of stages. MetaML extends …

With the proliferation of new hardware architectures and ever-evolving user requirements,
the software stack is becoming increasingly bloated. In practice, only a limited subset of the …

Probability distributions are useful for expressing the meanings of probabilistic languages,
which support formal modeling of and reasoning about uncertainty. Probability distributions …

Motivated by applications to proof assistants based on dependent types, we develop and
prove correct a strong reducer and ß-equivalence checker for the λ-calculus with products …

MetaML is a statically typed functional programming language with special support for
program generation. In addition to providing the standard features of contemporary …

The Curry-Howard isomorphism identifies proofs with typed/spl lambda/-calculus terms, and
correspondingly identifies propositions with types. We show how this isomorphism can be …

Solves the decision problem for the simply typed lambda calculus with a strong binary sum,
or, equivalently, the word problem for free Cartesian closed categories with binary co …

Software bloat has negative implications for security, reliability, and performance. To counter
bloat, we propose Trimmer, a static analysis-based system for pruning unused functionality …