Iliano Cervesato Advanced Engineering and Sciences Division ITT Industries,...  Home/Search
Context Related
| stanford.edu/~iliano/pape...jlc03.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu/~iliano/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present the spine calculus S as an efficient representation for the linear -calculus which includes unrestricted functions (!), linear functions ( ), additive pairing (&), and additive unit (>). S enhances the representation of Church's simply typed -calculus 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 languages without the... (Update)
Cited by: More
Small proof witnesses for LF - Sarkar, Pientka, Crary (2005) (Correct)
Similar documents (at the sentence level):
59.8%: A Linear Spine Calculus - Cervesato, Pfenning (2003) (Correct)
Active bibliography (related documents): More All
0.4: Linear Higher-Order Pre-Unification - Iliano Cervesato And (1997) (Correct)
0.2: On Zucker's isomorphism for LJ and its extension to Pure Type.. - Joachimski (2003) (Correct)
0.1: From Proof Normalization to Compiler Generation and.. - Vestergaard (1997) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@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
251 A logic programming language with lambda-abstraction - Miller - 1989
251 A logic programming language with lambda-abstraction - Miller - 1991
233 The formulae-as-types notion of construction (context) - Howard - 1979
136 System description: Twelf --- a meta-logical framework for d.. - Pfenning, Schurmann - 1999
121 Handbook of Theoretical Computer Science (context) - Dershowitz, Jouannaud - 1990
90 A linear logical framework - Cervesato, Pfenning - 2002
81 A multiple-conclusion meta-logic - Miller - 1994
63 Elf: A meta-language for deductive systems (context) - Pfenning - 1994
56 Unification and anti-unification in the Calculus of Construc.. - Pfenning - 1991
51 A relevant analysis of natural deduction - Ishtiaq, Pym - 1998
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
28 Eta-expansions in dependent type theory --- the calculus of .. - Ghani - 1997
25 and Jean-Jacques Levy (context) - Abadi, Cardelli et al. - 1991
24 The constructive engine (context) - Huet - 1989
19 Laboratory for Foundations of Computer Sciences (context) - Barber, linear et al. - 1996
19 Lambda Prolog: An introduction to the language and its logic (context) - Miller - 2001
18 the definition of the eta-long normal form in type systems o.. - Dowek, Huet et al. - 1993
14 Linear higher-order pre-unification - Cervesato, Pfenning - 1997
12 Permutability of proofs in intuitionistic sequent calculi - Dyckhoff, Pinto - 1999
12 Termination of permutative conversions in intuitionistic Gen.. - Schwichtenberg - 1999
12 Department of Computer Science (context) - Cervesato, Pfenning et al. - 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
7 Revisiting the correspondence between cut elimination and no.. (context) - Santo - 2000
5 Cut-elimination and a permutation-free sequent calculus for .. (context) - Dyckhoff, Pinto - 1998
5 The metalanguage lambda prolog and its implementation (context) - Nadathur - 2024
Documents on the same site (http://theory.stanford.edu/~iliano/papers/): More
Cryptographically Sound Security Proofs for - Basic And Public-Key (Correct)
The Logical Meeting Point of Multiset Rewriting and Process.. - Cervesato (2004) (Correct)
Towards a Notion of Quantitative Security Analysis - Cervesato (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