Peter Møller Neergaard, Harry G. Mairson  Home/Search
Context
Related
| churchproject.org...ai:LISICC02.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: churchproject.org/reports/ele... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We focus on how the choice of input-output representation has a crucial impact on the expressiveness of so-called "logics of polynomial time." Our analysis illustrates this dependence in the context of Light A#ne Logic (LAL), which is both a restricted version of Linear Logic, and a primitive functional programming language with restricted sharing of arguments. By slightly relaxing representation conventions, we derive doubly-exponential expressiveness bounds for this "logic of... (Update)
Active bibliography (related documents): More All
0.7: A Functional Language for Logarithmic Space - Neergaard (2004) (Correct)
0.5: Higher-Order Linear Ramified Recurrence - Lago, Martini, Roversi (2004) (Correct)
0.2: Relating Typability and Expressiveness in Finite-Rank .. - Kfoury, Mairson.. (1999) (Correct)
Similar documents based on text: More All
0.3: Rank Bounded Intersection: Types, Potency, and Idempotency - Neergaard, Mairson (2003) (Correct)
0.3: How Light Is Safe Recursion? Compositional Translations.. - Neergaard, Mairson (2001) (Correct)
0.3: Conservation and Uniform Normalization in Lambda Calculi.. - Neergaard, Sørensen (2002) (Correct)
BibTeX entry: (Update)
@misc{ neergaard-lal,
author = "Peter Møller Neergaard and Harry G. Mairson",
title = "LAL Is Square: Representation and Expressiveness in Light Affine Logic",
url = "citeseer.ist.psu.edu/neergaard02lal.html" }
Citations (may not include all citations):242 Linear logic (context) - Girard - 1987
211 Languages that capture complexity classes - Immerman - 1987 ACM DBLP
96 A new recursion-theoretic characterization of the polytime f.. (context) - Bellantoni, Cook - 1992
88 Linear logic: its syntax and semantics - Girard
83 volume 7 of Cambridge tracts in theoretical computer science (context) - Girard, Lafont et al. - 1989
73 Untersuchungen uber das logische Schlieen (context) - Gentzen - 1934
58 Linear type and non-size-increasing polynomial time computat.. - Hofmann - 1999
58 Linear types and non-size-increasing polynomial time computa.. - Hofmann ACM DBLP
40 Proof-nets: The parallel syntax for proof-theory (context) - Girard - 1996
34 Computability and Complexity: From a Programming Perspective (context) - Jones - 1997
33 From proof-nets to interaction nets - Lafont ACM
21 Light linear logic - Girard - 1998 ACM DBLP
17 Machine models and simulations (context) - Boas - 1990 ACM
11 The typed lambda-calculus is not elementary recursive (context) - Statman - 1979 DBLP
10 ne logic (context) - Asperti - 1998
7 Advances in Linear Logic (context) - Girard, Lafont et al. - 1995 ACM
5 ACM Transactions on Computational Logic (context) - Asperti, Roversi et al. - 2002
5 An analysis of the CoreML language: Expressive power and typ.. - Kanellakis, Hillebrand et al. - 1994
3 Soft linear logic and polynomial time - Lafont ACM
1 ne lambda calculus and polytime strong normalization (context) - Terui - 2001
1 ne logic as a programming language: a first contribution (context) - Roversi - 2000
1 Definierbare Funktionen im #--Kalkul mit Typen (context) - Schwichtenberg - 1976
Documents on the same site (http://www.church-project.org/reports/electronic/): More
Types, Potency, and Idempotency: Why Nonlinearity and.. - Neergaard, Mairson (2004) (Correct)
Principality and Type Inference for Intersection Types Using.. - Kfoury, Wells (2003) (Correct)
Meta-Programming through Typeful Code Representation - Chen, Xi (2003) (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