In order to simplify the compilation process, many compilers for higher-order languages use
the continuation-passing style (CPS) transformation in a first phase to generate an …

Notions of program dependency arise in many settings: security, partial evaluation, program
slicing, and call-tracking. We argue that there is a central notion of dependency common to …

We present a strikingly simple partial evaluator, that is type-directed and reifies a compiled
program into the text of a residual, specialized program. Our partial evaluator is concise (a …

We show that standard formulations of intersection type systems are unsound in the
presence of computational effects, and propose a solution similar to the value restriction for …

Relational program verification is a variant of program verification where one can reason
about two programs and as a special case about two executions of a single program on …

A multi-stage computation is one involving more than one stage of execution. MetaML is a
language for programming multi-stage computations. Previous studies presented big-step …

Dependency analysis is vital to several applications in computer science. It lies at the
essence of secure information flow analysis, binding-time analysis, etc. Various calculi have …

We formalize a partial evaluator for Eugenio Moggi's computational metalanguage. This
formalization gives an evaluation-order independent view of binding-time analysis and …

Given a tower of interpreters, ie, a sequence of multiple interpreters interpreting one another
as input programs, we aim to collapse this tower into a compiler that removes all interpretive …

This paper extends previous work on the modal logic CK as a reference system, both proof-
theoretically and model-theoretically, for a correspondence theory of constructive modal …