(Enter summary)
Abstract: We present the spine calculus S
as an efficient representation for the linear -calculus
which includes intuitionistic functions (!), linear functions (\Gammaffi), additive pairing (&), and additive unit
(?). S
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 that characterizes first-order term... (Update)
Cited by: More
Small proof witnesses for LF - Sarkar, Pientka, Crary (2005)
(Correct)
Similar documents (at the sentence level):
20.1%: A Linear Spine Calculus - Cervesato, Pfenning (2003)
(Correct)
Active bibliography (related documents): More All
0.3: Linear Higher-Order Pre-Unification - Iliano Cervesato And (1997)
(Correct)
0.2: Unknown - Labeled Deduction Starting
(Correct)
0.1: Unification via Explicit Substitutions: - The Case Of
(Correct)
Similar documents based on text:
0.0: Unknown -
(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/cervesato03linear.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/cervesato03linear.html" }
Citations (may not include all citations):
982
Theoretical Computer Science (context) - Girard - 1987
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
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
40
The virtues of eta-expansion
- Jay, Ghani - 1995
36
Dipartimento di Informatica (context) - Cervesato, Logical et al. - 1996
35
Lambda-calculus notation with nameless dummies: a tool for a.. (context) - de Bruijn - 1972
33
A preliminary version appeared in the Proceedings of the Six.. (context) - Hodas, Miller et al. - 1991
25
and Jean-Jacques L'evy (context) - Abadi, Cardelli et al. - 1991
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
11
An empirical study of the runtime behavior of higher-order l.. (context) - Michaylov, Pfenning - 1992
10
calculus structure isomorphic to Genzten-style sequent calcu.. (context) - Herbelin - 1995
4
Reprinted in To H (context) - Howard, notion et al. - 1980
Documents on the same site (http://www.cs.cmu.edu/~fp/publications.html): More
Verifying Uniqueness in a Logical Framework - Anderson, Pfenning (2004)
(Correct)
Compiler Verification in LF - Hannan, Pfenning (1992)
(Correct)
Meta-Programming with Names and Necessity - Nanevski, Pfenning (2002)
(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