Results 1 
6 of
6
Explicit Provability And Constructive Semantics
 Bulletin of Symbolic Logic
, 2001
"... In 1933 G odel introduced a calculus of provability (also known as modal logic S4) and left open the question of its exact intended semantics. In this paper we give a solution to this problem. We find the logic LP of propositions and proofs and show that G odel's provability calculus is nothing b ..."
Abstract

Cited by 114 (22 self)
 Add to MetaCart
In 1933 G odel introduced a calculus of provability (also known as modal logic S4) and left open the question of its exact intended semantics. In this paper we give a solution to this problem. We find the logic LP of propositions and proofs and show that G odel's provability calculus is nothing but the forgetful projection of LP. This also achieves G odel's objective of defining intuitionistic propositional logic Int via classical proofs and provides a BrouwerHeytingKolmogorov style provability semantics for Int which resisted formalization since the early 1930s. LP may be regarded as a unified underlying structure for intuitionistic, modal logics, typed combinatory logic and #calculus.
DomainFree Pure Type Systems
 JOURNAL OF FUNCTIONAL PROGRAMMING
, 1993
"... Pure type systems make use of domainfull λabstractions λx:D.M . We present a variant of pure type systems, which we call domainfree pure type systems, with domainfree λabstractions λx.M. Domainfree pure type systems have a number of advantages over both pure type systems and socalled type ass ..."
Abstract

Cited by 34 (8 self)
 Add to MetaCart
Pure type systems make use of domainfull λabstractions λx:D.M . We present a variant of pure type systems, which we call domainfree pure type systems, with domainfree λabstractions λx.M. Domainfree pure type systems have a number of advantages over both pure type systems and socalled type assignment systems (they also have some disadvantages) and have been used in theoretical developments as well as in implementations of proofassistants. We study the basic properties of domainfree pure type systems, establish their formal relationship with pure type systems and type assignment systems, and give a number of applications of these correspondences.
CPS Translations and Applications: The Cube and Beyond
 Higher Order and Symbolic Computation
, 1996
"... Continuation passing style (CPS) translations of typed calculi have numerous applications. However, the range of these applications has been conned by the fact that CPS translations are known for nondependent type systems only, thus excluding wellknown systems like the calculus of constructions ( ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Continuation passing style (CPS) translations of typed calculi have numerous applications. However, the range of these applications has been conned by the fact that CPS translations are known for nondependent type systems only, thus excluding wellknown systems like the calculus of constructions (CC) and the logical frameworks (LF). This paper presents techniques for CPS translating systems with dependent types, with an emphasis on pure typetheoretical applications.
Explicit substitutions for the lambda Deltacalculus
"... . The \Deltacalculus is a calculus with a controllike operator whose reduction rules are closely related to normalisation procedures in classical logic. We introduce \Deltaexp, an explicit substitution calculus for \Delta, and study its properties. In particular, we show that \Deltaexp preserves ..."
Abstract
 Add to MetaCart
. The \Deltacalculus is a calculus with a controllike operator whose reduction rules are closely related to normalisation procedures in classical logic. We introduce \Deltaexp, an explicit substitution calculus for \Delta, and study its properties. In particular, we show that \Deltaexp preserves strong normalisation, which provides us with the first example moreover a very natural one indeed of explicit substitution calculus which is not structurepreserving and has the preservation of strong normalisation property. One particular application of this result is to prove that the simply typed version of \Deltaexp is strongly normalising. In addition, we show that Plotkin's callbyname continuationpassing style translation may be extended to \Deltaexp and that the extended translation preserves typing. This seems to be the first study of CPS translations for calculi of explicit substitutions. 1 Introduction Explicit substitutions were introduced by Abadi, Cardelli, Curien and L...
Explicit Substitutions for the λΔcalculus
"... The λΔcalculus is a λcalculus with a controllike operator whose reduction rules are closely related to normalisation procedures in classical logic. We introduce λΔexp, an explicit substitution calculus for λΔ, and study its properties. In particular, we show that λΔexp preserves strong normalisa ..."
Abstract
 Add to MetaCart
The λΔcalculus is a λcalculus with a controllike operator whose reduction rules are closely related to normalisation procedures in classical logic. We introduce λΔexp, an explicit substitution calculus for λΔ, and study its properties. In particular, we show that λΔexp preserves strong normalisation, which provides us with the first example  moreover a very natural one indeed  of explicit substitution calculus which is not structurepreserving and has the preservation of strong normalisation property. One particular application of this result is to prove that the simply typed version of λΔexp is strongly normalising. In addition, we show that Plotkin's callbyname continuationpassing style translation may be extended to λΔexp and that the extended translation preserves typing. This seems to be the first study of CPS translations for calculi of explicit substitutions.