This paper describes formalizations of Tait's normalization proof for the simply typed λ-
calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs …

An Analytical Approach to Programs as Data Objects Page 1 Olivier Danvy Doctoral thesis An
Analytical Approach to Programs as Data Objects Department of Computer Science Page 2 An …

We present direct proofs of termination of evaluation for typed delimited-control operators
shift and reset using a variant of Tait's method with context-based reducibility predicates. We …

From Mathematics to Abstract Machine Page 1 J. Chapman and PB Levy (Eds.): Fourth
Workshop on Mathematically Structured Functional Programming (MSFP 2012). EPTCS 76 …

We present a context-based approach to proving termination of evaluation in reduction
semantics (ie, a form of operational semantics with explicit representation of reduction …

We present a method for mechanically obtaining certified one-pass, higher-order
transformations of lambda terms into continuation-passing style. Given a naive, non …

In this thesis, the author describes the research carried out during his PhD-studies. The
results presented in this thesis have previously been published in a number of papers ([38 …

It is well known that the computational content of a termination proof of a calculus is an
interpreter that computes the result of an input term. Traditionally, such extraction has been …

Moje najważniejsze osiągnięcia naukowe dotyczą semantyki języków programowania
wyższego rzędu z kontynuacjami oraz jej zastosowań w zakresie implementacji języków …

There is a close relationship between lambda calculi with explicit substitutions and abstract
machines. Biernacka and Danvy [7] have shown how to derive several well-known abstract …