Cryptographic protocols often make use of nested cryptographic primitives, for example signed message digests, or encrypted signed messages. Gordon and Jeffrey’s prior work on ty...
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
This paper gives the first proof that the subtyping relation of a higherorder lambda calculus, Fω ≤, is anti-symmetric, establishing in the process that the subtyping relation...
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
d Abstract) Allyn Dimock Harvard University Robert Muller Boston College Franklyn Turbak Wellesley College J. B. Wells∗ Glasgow University Topic Areas: compilation, lambda calcul...
Allyn Dimock, Robert Muller, Franklyn A. Turbak, J...