Peter Møller Neergaard, Harry G. Mairson  Home/Search
Context
Related
| churchproject.org...issaferec.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 investigate the relationship between two polynomial time languages: Bellantoni and Cook's functional combinator language BC, and Girard's Light Linear Logic LAL (as amended by Asperti). It is known that both languages characterize exactly the polynomial time functions. Despite this similarity, an open question has been to provide a compositional translation between the two languages: given a ptime function f described in a BC program pf , how can we translate pf into an LAL-program?... (Update)
Active bibliography (related documents): More All
0.7: A Functional Language for Logarithmic Space - Neergaard (2004) (Correct)
0.3: Higher-Order Linear Ramified Recurrence - Lago, Martini, Roversi (2004) (Correct)
0.2: LAL Is Square: Representation and Expressiveness in Light.. - Neergaard, Mairson (2002) (Correct)
Similar documents based on text: More All
0.5: Conservation and Uniform Normalization in Lambda Calculi.. - Neergaard, Sørensen (2002) (Correct)
0.4: Rank Bounded Intersection: Types, Potency, and Idempotency - Neergaard, Mairson (2003) (Correct)
0.2: Types, Potency, and Idempotency: Why Nonlinearity and.. - Neergaard, Mairson (2004) (Correct)
BibTeX entry: (Update)
@misc{ neergaard-how,
author = "Peter M{\o}ller Neergaard and Harry G. Mairson",
title = "How Light Is Safe Recursion? Compositional Translations between Languages
of Polynomial Time",
url = "citeseer.ist.psu.edu/neergaard01how.html" }
Citations (may not include all citations):96 A new recursion-theoretic characterization of the polytime f.. (context) - Bellantoni, Cook - 1992
11 Light ane logic (context) - Asperti - 1998
5 ACM Transactions on Computational Logic (context) - Asperti, Roversi et al. - 2002
2 A term rewriting characterization of the polytime functions .. (context) - Beckmann, Weiermann - 1996
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