(Enter summary)
Abstract: We present the spine calculus S
!\Gammaffi&?
as an efficient representation for the linear -calculus
!\Gammaffi&?
which includes intuitionistic functions (!), linear functions (\Gammaffi), additive pairing (&), and additive unit
(?). S
!\Gammaffi&?
enhances the representation of Church's simply typed -calculus as abstract Bohm trees
by enforcing extensionality and by incorporating linear constructs. This approach permits procedures
such as unification to retain the efficient head access... (Update)
Cited by: More
Small proof witnesses for LF - Sarkar, Pientka, Crary (2005)
(Correct)
Similar documents (at the sentence level):
22.2%: A Linear Spine Calculus - Cervesato, Pfenning (2003)
(Correct)
Active bibliography (related documents): More All
0.2: Linear Higher-Order Pre-Unification - Iliano Cervesato, Frank Pfenning (1997)
(Correct)
0.1: The Practice of Logical Frameworks - Frank Pfenning (1996)
(Correct)
0.1: Proof-search in Type-theoretic Languages: An Introduction - Galmiche, Pym (2000)
(Correct)
Similar documents based on text: More All
0.4: Linear Higher-Order Pre-Unification (Extended Abstract) - Iliano Cervesato, Frank.. (1996)
(Correct)
0.4: An Earley-style Predictive Chart Parsing Method for Lambek Grammars - Hepple (1999)
(Correct)
0.4: The Undecidability of Second Order Multiplicative Linear Logic - Lafont, Scedrov (1996)
(Correct)
BibTeX entry: (Update)
Iliano Cervesato and Frank Pfenning. A linear spine calculus. Journal of Logic and Computation, 13(5):639--688, 2003. http://citeseer.ist.psu.edu/article/cervesato97linear.html More
@techreport{ cervesato97linear,
author = "Iliano Cervesato and Frank Pfenning",
title = "A Linear Spine Calculus",
number = "CMU-CS-97-125",
address = "Pittsburgh, PA",
year = "1997",
url = "citeseer.ist.psu.edu/article/cervesato97linear.html" }
Citations (may not include all citations):
729
The Lambda-Calculus: Its Syntax and Semantics (context) - Barendregt - 1980
434
A framework for defining logics
- Harper, Honsell et al. - 1993
419
A formulation of a simple theory of types (context) - Church - 1940
340
Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
215
Theoretical Computer Science (context) - Girard - 1987
210
Logic programming in the LF logical framework
- Pfenning - 1991
166
An overview of Prolog (context) - Nadathur, Miller - 1988
121
Handbook of Theoretical Computer Science (context) - Dershowitz, Jouannaud - 1990
90
A linear logical framework
- Cervesato, Pfenning - 1996
81
A multiple-conclusion meta-logic
- Miller - 1994
63
Elf: A meta-language for deductive systems (context) - Pfenning - 1994
51
A relevant analysis of natural deduction
- Ishtiaq, Pym - 1996
46
Lambda-calculus notation with nameless dummies: a tool for a.. (context) - de Bruijn - 1972
40
The virtues of eta-expansion
- Jay, Ghani - 1995
36
Dipartimento di Informatica (context) - Cervesato, Logical et al. - 1996
28
and Jean-Jacques L'evy (context) - Abadi, Cardelli et al. - 1991
25
An empirical study of the runtime behavior of higher-order l..
- Michaylov, Pfenning - 1992
19
Laboratory for Foundations of Computer Sciences (context) - Barber, linear et al. - 1996
14
Linear higher-order pre-unification
- Cervesato, Pfenning - 1997
12
Termination of permutative conversions in intuitionistic Gen..
- Schwichtenberg - 1997
10
calculus structure isomorphic to Genzten-style sequent calcu.. (context) - Herbelin - 1995
Documents on the same site (http://foxnet.cs.cmu.edu/afs/cs.cmu.edu/project/fox/mosaic/people/fp/): More
Ordered Linear Logic Programming - Polakow, Pfenning (1998)
(Correct)
Unification via Explicit Substitutions: The Case of.. - Dowek, Hardin.. (1996)
(Correct)
A Schema for Adding Dependent Types to ML - Xi, Pfenning (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC