Results 1  10
of
10
Mechanizing Language Definitions
, 2006
"... We present a technical introduction to mechanizing language definitions and metatheory using LF and Twelf. LF is a logical framework designed for representing languages that are specified by inductivelydefined judgements. Twelf is an implementation of LF that includes additional support for checki ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We present a technical introduction to mechanizing language definitions and metatheory using LF and Twelf. LF is a logical framework designed for representing languages that are specified by inductivelydefined judgements. Twelf is an implementation of LF that includes additional support for checking metatheorems about represented languages. In this article, we first summarize a canonicalforms presentation of LF, following the treatment of CLF by Watkins et al. Next, we use the simplytyped #calculus as a running example of mechanization in LF and Twelf: we show how to adequately encode the simplytyped #calculus in LF, and then we prove type preservation and strengthening as examples of Twelf metatheory.
A Meta Linear Logical Framework
 In 4th International Workshop on Logical Frameworks and MetaLanguages (LFM’04
, 2003
"... Over the years, logical framework research has produced various type theories designed primarily for the representation of deductive systems. Reasoning about these representations requires expressive special purpose meta logics, that are in general not part of the logical framework. ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Over the years, logical framework research has produced various type theories designed primarily for the representation of deductive systems. Reasoning about these representations requires expressive special purpose meta logics, that are in general not part of the logical framework.
Strong Normalization Proofs for Cut Elimination in Gentzen's Sequent Calculi
 Banach Center Publication
, 1999
"... We define an equivalent variant LK sp of the Gentzen sequent calculus LK. In LK sp weakenings or contractions can be performed in parallel. This modification allows us to interpret a symmetrical system of mix elimination rules by a finite rewriting system; the termination of this rewriting system ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We define an equivalent variant LK sp of the Gentzen sequent calculus LK. In LK sp weakenings or contractions can be performed in parallel. This modification allows us to interpret a symmetrical system of mix elimination rules by a finite rewriting system; the termination of this rewriting system can be machine checked. We give also a selfcontained strong normalization proof by structural induction. We give another strong normalization proof by a strictly monotone subrecursive interpretation; this interpretation gives subrecursive bounds for the length of derivations. We give a strong normalization proof by applying orthogonal term rewriting results for a confluent restriction of the mix elimination system .
A Computational Meta Logic for the Horn Fragment of LF
, 1995
"... The logical framework LF is a type theory defined by Harper, Honsell and Plotkin. It is wellsuited to serve as a meta language to represent deductive systems. LF and its logic programming implementation Elf are also wellsuited to represent metatheoretic proofs and their computational content, but ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
The logical framework LF is a type theory defined by Harper, Honsell and Plotkin. It is wellsuited to serve as a meta language to represent deductive systems. LF and its logic programming implementation Elf are also wellsuited to represent metatheoretic proofs and their computational content, but search for such proofs lies outside the framework. This thesis proposes a computational meta logic (MLF) for the Horn fragment of LF. The Horn fragment is a significant restriction of LF but it is powerful enough to represent nontrivial problems. This thesis demonstrates how MLF can be used for the problem of compiler verification. It also discusses some theoretical properties of MLF. Contents 1 Introduction 1 2 Motivation 3 2.1 An Example : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.1.1 A Toy Language : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.1.2 Natural Semantics : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :...
A Formalisation Of Weak Normalisation (With Respect To Permutations) Of Sequent Calculus Proofs
, 1999
"... rule). This is also the case for NJ and LJ as defined in this formalisation. This is due to the particular nature of the logics in question, and does not necessarily generalise to other logics. In particular, a formalisation of linear logic would not work in this fashion, and a more complex variable ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
rule). This is also the case for NJ and LJ as defined in this formalisation. This is due to the particular nature of the logics in question, and does not necessarily generalise to other logics. In particular, a formalisation of linear logic would not work in this fashion, and a more complex variablereferencing mechanism would be required. See Section 6 for a further discussion of this problem. Other operations, such as substitutions (sub in Table 2) and weakening, require lift and drop operations as defined in [27] to ensure the correctness of the de Bruijn indexing.
Refinement Types for Logical Frameworks
, 2010
"... The logical framework LF and its metalogic Twelf can be used to encode and reason about a wide variety of logics, languages, and other deductive systems in a formal, machinecheckable way. Recent studies have shown that MLlike languages can profitably be extended with a notion of subtyping called r ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The logical framework LF and its metalogic Twelf can be used to encode and reason about a wide variety of logics, languages, and other deductive systems in a formal, machinecheckable way. Recent studies have shown that MLlike languages can profitably be extended with a notion of subtyping called refinement types. A refinement type discipline uses an extra layer of term classification above the usual type system to more accurately capture certain properties of terms. I propose that adding refinement types to LF is both useful and practical. To support the claim, I exhibit an extension of LF with refinement types called LFR, work out important details of its metatheory, delineate a practical algorithm for refinement type reconstruction, and present several case studies that highlight the utility of refinement types for formalized mathematics. In the end I find that refinement types and LF are a match made in heaven: refinements enable many rich new modes of expression, and the simplicity of
Structural Cut Elimination in Linear Logic
, 1994
"... We present a new proof of cut elimination for linear logic which proceeds by three nested structural inductions, avoiding the explicit use of multisets and termination measures on sequent derivations. The computational content of this proof is a nondeterministic algorithm for cut elimination which ..."
Abstract
 Add to MetaCart
We present a new proof of cut elimination for linear logic which proceeds by three nested structural inductions, avoiding the explicit use of multisets and termination measures on sequent derivations. The computational content of this proof is a nondeterministic algorithm for cut elimination which is amenable to an elegant implementation in Elf. We show this implementation in detail. This work was supported by NSF Grant CCR9303383 The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or implied, of NSF or the U.S. government. Keywords: Linear Logic, Cut Elimination, Logical Framework Contents 1 Introduction 1 2 CLL: A Traditional Sequent Calculus for Linear Logic 1 3 LV: Another Sequent Calculus for Linear Logic 3 4 Linear Proof Terms 8 5 Representation in LF 11 5.1 Formulas : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 11 5.2 Pro...
This is brought to you for free and open access by the Theses and Dissertations at Research Showcase. It has been accepted for inclusion in Dissertations by an authorized administrator of Research Showcase. For more information, please contact researchsh
, 2010
"... Technology Institute (ICTI) at Carnegie Mellon University, and by generous support from ..."
Abstract
 Add to MetaCart
Technology Institute (ICTI) at Carnegie Mellon University, and by generous support from
Proving Metatheorems with Twelf
, 2006
"... Notes to proofreaders: • I haven’t had time to do many of the adequacy proofs yet. If you know of a way of streamlining these, I’d love to hear it. I wonder if moving to a Kevinstyle presentation would help? • The theorem in Appendix A stating that equivalent worlds have the same canonical forms is ..."
Abstract
 Add to MetaCart
Notes to proofreaders: • I haven’t had time to do many of the adequacy proofs yet. If you know of a way of streamlining these, I’d love to hear it. I wonder if moving to a Kevinstyle presentation would help? • The theorem in Appendix A stating that equivalent worlds have the same canonical forms is true (in the sense that I wrote out the proof on paper, but I haven’t had a chance to type it up yet). I haven’t seen this written up anywhere, so please let me know if it exists. These notes are a rough draft; please alert me to any errors or omissions!