Results 1 
6 of
6
A Computational Approach to Reflective MetaReasoning about Languages with Bindings
 In MERLIN ’05: Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized
, 2005
"... We present a foundation for a computational metatheory of languages with bindings implemented in a computeraided formal reasoning environment. Our theory provides the ability to reason abstractly about operators, languages, openended languages, classes of languages, etc. The theory is based on th ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
We present a foundation for a computational metatheory of languages with bindings implemented in a computeraided formal reasoning environment. Our theory provides the ability to reason abstractly about operators, languages, openended languages, classes of languages, etc. The theory is based on the ideas of higherorder abstract syntax, with an appropriate induction principle parameterized over the language (i.e. a set of operators) being used. In our approach, both the bound and free variables are treated uniformly and this uniform treatment extends naturally to variablelength bindings. The implementation is reflective, namely there is a natural mapping between the metalanguage of the theoremprover and the object language of our theory. The object language substitution operation is mapped to the metalanguage substitution and does not need to be defined recursively. Our approach does not require designing a custom type theory; in this paper we describe the implementation of this foundational theory within a generalpurpose type theory. This work is fully implemented in the MetaPRL theorem prover, using the preexisting NuPRLlike MartinL ofstyle computational type theory. Based on this implementation, we lay out an outline for a framework for programming language experimentation and exploration as well as a general reflective reasoning framework. This paper also includes a short survey of the existing approaches to syntactic reflection. 1
OrderTheoretic, Geometric and Combinatorial Models of Intuitionistic S4 Proofs
 IN INTUITIONISTIC MODAL LOGICS AND APPLICATIONS (IMLA’99)
, 1999
"... We propose a few models of proof terms for the intuitionistic modal propositional logic S4. Some of them are based on partial orders, or cpos, or dcpos, some of them on a suitable category of topological spaces and continuous maps. A structure that emerges from these interpretations is that of augme ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We propose a few models of proof terms for the intuitionistic modal propositional logic S4. Some of them are based on partial orders, or cpos, or dcpos, some of them on a suitable category of topological spaces and continuous maps. A structure that emerges from these interpretations is that of augmented simplicial sets. This leads to socalled combinatorial models, where simplices play an important role: the point is that the simplicial structure interprets the 2 modality, and that the category of augmented simplicial sets is itself already a model of intuitionistic propositional S4 proof terms. In fact, this category is an elementary topos, and is therefore a prime candidate to interpret all proof terms for intuitionistic S4 set theory. Finally, we suggest that geometriclike realizations functors provide a recipe to build other models of intuitionistic propositional S4 proof terms.
Verifying Uniqueness in a Logical Framework
, 2004
"... We present an algorithm for verifying that some specified arguments of an inductively defined relation in a dependently typed # calculus are uniquely determined by some other arguments. We prove it correct and also show how to exploit this uniqueness information in coverage checking, which allo ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We present an algorithm for verifying that some specified arguments of an inductively defined relation in a dependently typed # calculus are uniquely determined by some other arguments. We prove it correct and also show how to exploit this uniqueness information in coverage checking, which allows us to verify that a definition of a function or relation covers all possible cases. In combination, the two algorithms significantly extend the power of the metareasoning facilities of the Twelf implementation of LF.
Metatheoretical Results for a Modal λCalculus
, 2000
"... This paper presents the proofs of the strong normalization, subject reduction, and ChurchRosser theorems for a presentation of the intuitionistic modal calculus S4. It is adapted from Healfdene Goguen's thesis, where these properties are shown for the simply typed  calculus and for Luo's type ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This paper presents the proofs of the strong normalization, subject reduction, and ChurchRosser theorems for a presentation of the intuitionistic modal calculus S4. It is adapted from Healfdene Goguen's thesis, where these properties are shown for the simply typed  calculus and for Luo's type theory UTT. Following this method, we introduce the notion of typed operational semantics for our system. We dene a notion of typed substitution for our system, which has context stacks instead of the usual contexts. This latter peculiarity leads to the main diculties and consequently to the main original features in our proofs. The techniques elaborated in this work have already been found useful in recent works [DL98, DL99] and should be further exploited to prove the properties of other systems based on modality. 1 Introduction We present here proofs of metatheoretic results for the modal calculus IS4 (see, for example, [Che90] for a classication of modal logics), in the ...
A Modal Lambda Calculus with Iteration and Case Constructs
, 1998
"... An extension of the simplytyped calculus, allowing iteration and case reasoning over terms of functional types that arise when using higher order abstract syntax, has recently been introduced by Joëlle Despeyroux, Frank Pfenning and Carsten Schürmann. This thorny mixing is achieved thanks to the h ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
An extension of the simplytyped calculus, allowing iteration and case reasoning over terms of functional types that arise when using higher order abstract syntax, has recently been introduced by Joëlle Despeyroux, Frank Pfenning and Carsten Schürmann. This thorny mixing is achieved thanks to the help of the operator ` ' of modal logic S4. Here we give a new presentation of their system, with reduction rules, instead of evaluation judgments, that compute the canonical forms of terms. Our presentation is based on a modal calculus that is better from the user's point of view because it requires fewer annotations in terms. Moreover we do not impose a particular strategy of reduction during the computation. Our system enjoys the decidability of typability, soundness of typed reduction with respect to typing rules, the ChurchRosser and strong normalization properties and it is a conservative extension of the simplytyped calculus.