• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

A Linear Logical Framework (1996)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.cs.stanford.edu]
  • [theory.stanford.edu]
  • [foxnet.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.lb.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu]
  • [www.lb.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [theory.stanford.edu]
  • [theory.stanford.edu]
  • [theory.stanford.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Iliano Cervesato , Frank Pfenning
Citations:203 - 44 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Cervesato96alinear,
    author = {Iliano Cervesato and Frank Pfenning},
    title = {A Linear Logical Framework},
    booktitle = {},
    year = {1996},
    pages = {264--275},
    publisher = {IEEE Computer Society Press}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We present the linear type theory LLF as the forAppeared in the proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science --- LICS'96 (E. Clarke editor), pp. 264--275, New Brunswick, NJ, July 27--30 1996. mal basis for a conservative extension of the LF logical framework. LLF combines the expressive power of dependent types with linear logic to permit the natural and concise representation of a whole new class of deductive systems, namely those dealing with state. As an example we encode a version of Mini-ML with references including its type system, its operational semantics, and a proof of type preservation. Another example is the encoding of a sequent calculus for classical linear logic and its cut elimination theorem. LLF can also be given an operational interpretation as a logic programming language under which the representations above can be used for type inference, evaluation and cut-elimination. 1 Introduction A logical framework is a formal system desig...

Citations

634 A framework for defining logics - Harper, Honsell, et al. - 1999
541 Linear Logic - Girard - 1987
493 Untersuchungen über das logische Schließen - Gentzen - 1935
474 Lambda Calculi with Types - Barendregt - 1992
466 Introduction to HOL : a theorem proving environment for higher-order logic - Gordon, Melham - 1993
425 Institutions: Abstract model theory for specification and programming - Goguen, Burstall - 1992
395 The formulae-as-types notion of construction - Howard - 1980
386 Isabelle: A generic theorem prover - Paulson - 1994
334 Uniform proofs as a foundation for logic programming - Miller, Nadathur, et al. - 1991
290 Logic programming with focusing proofs in linear logic - Andreoli - 1992
280 Natural semantics - Kahn - 1988
278 Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation - Bruijn - 1972
271 A logic programming language with lambda-abstraction, function variables, and simple unification - Miller - 1991
269 Higher-order abstract syntax - Pfenning, Elliott - 1988
242 Programming in Martin-Löf’s Type Theory. An Introduction - Nordström, Petersson, et al. - 1990
235 Constructive mathematics and computer programming - Martin-Lof - 1982
176 An Overview of *Prolog - Nadathur, Miller - 1988
172 Logic programming in the LF logical framework - Pfenning - 1991
169 A unication algorithm for typed calculus - Huet - 1975
145 Rewriting logic as a logical and semantic framework - Martí-Oliet, Meseguer - 2001
142 Proving and applying program transformations expressed with second-order patterns - Huet, Lang - 1978
124 The undecidability of the second-order unification problem - Goldfarb - 1981
123 Introduction to Higher-Order Categorical Logic - Lambek, Scott - 1986
119 Higher-order critical pairs - Nipkow - 1991
117 On the meanings of the logical constants and the justifications of the logical laws - Martin-Löf - 1996
117 Primitive recursion for higher-order abstract syntax - Schürmann, Despeyroux, et al. - 2001
103 An algorithm for testing conversion in type theory - Coquand - 1990
97 A unification algorithm for typed λ-calculus - Huet - 1975
94 An overview of elan - Borovansk, Kirchner, et al. - 1998
92 The ALF proof editor and its proof engine - Magnusson, Nordström - 1994
87 Asurvey of the project AUTOMATH - Bruijn - 1980
85 The semantics of reflected proof - Allen, Constable, et al. - 1990
84 Forum: A Multiple-Conclusion Meta-Logic - Miller - 1996
79 Partial polymorphic type inference and higher-order unification - Pfenning - 1988
78 Using typed lambda calculus to implement formal systems on a machine - Avron, Honsell, et al. - 1992
78 On equivalence and canonical forms in the LF type theory - Harper, Pfenning - 2005
70 Elf: A language for logic definition and verified metaprogramming - Pfenning - 1989
69 The mathematical language AUTOMATH, its usage and some of its extensions - Bruijn - 1968
65 The Theory of LEGO: A Proof Checker for the Extended Calculus of Constructions - Pollack - 1994
63 Some properties of conversion - Church, Rosser
62 Specifying theorem provers in a higher-order logic programming language - Felty, Miller - 1988
61 Implementing tactics and tacticals in a higher-order logic programming language - Felty - 1993
56 Unification and anti-unification in the calculus of constructions - Pfenning - 1991
55 Structural cut elimination - Pfenning - 1995
54 Metalogical frameworks - Basin, Constable - 1993
53 Grundlagen der Mathematik - Hilbert, Bernays - 1934
51 Natural deduction as higher-order resolution - Paulson - 1986
51 eine der arithmetischen nachgebildete Formelsprache des reinen Denkens. 1879. Translation [vHe67, 5–82]. Gentzen, G. Untersuchungen über das logische Schließen I - Frege
44 The Coq proof assistant user’s guide. Rapport Techniques 154 - Dowek, Felty, et al. - 1993
43 Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language - Felty - 1989
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University