Klaus Aehlig, Helmut Schwichtenberg  Home/Search
Context Related
Links: ACM DBLP | mathematik.unimuenchen.de/...coin.ps.Z 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: mathematik.unim...schwichtenberg (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A purely syntactical proof is given that all functions definable in a certain affine linear typed -calculus with iteration in all types are polynomial time computable. The proof also gives explicit polynomial bounds that can easily be calculated. 1 Summary In [6] Hofmann presented a linear type system for non-size-increasing polynomial time computation allowing unrestricted recursion for inductive datatypes. The proof that all definable functions of type N ( N are polynomial time... (Update)
Cited by: More
A judgmental analysis of linear logic - Bor-Yuh Evan Chang (Correct)
A Judgmental Analysis of Linear Logic - Bor-Yuh Evan Chang (2003) (Correct)
A Judgmental Analysis Of Linear Logic - Bor-Yuh Evan Chang (2003) (Correct)
Similar documents (at the sentence level):
62.6%: A Syntactical Analysis of Non-Size-Increasing Polynomial.. - Klaus Aehlig Helmut (2000) (Correct)
18.2%: An Arithmetic for Non-Size-Increasing Polynomial-Time Computation - Aehlig (Correct)
Active bibliography (related documents): More All
0.3: Feasible Programs from Proofs - Schwichtenberg (2000) (Correct)
0.3: Higher Type Recursion, Ramification and Polynomial Time - Bellantoni, Niggl.. (1999) (Correct)
0.3: Semantics of Linear/modal Lambda Calculus - Hofmann (1998) (Correct)
Similar documents based on text: More All
0.5: Linear Types and Non-Size-Increasing Polynomial Time Computation - Hofmann (1998) (Correct)
0.3: Continuous Normalization for the Lambda-Calculus and Gödel's T - Aehlig, Joachimski (Correct)
0.2: An Elementary Fragment of Second-Order Lambda Calculus - Aehlig, Johannsen (Correct)
Related documents from co-citation: More All
21: Linear types and non-size-increasing polynomial time computation - Hofmann - 1998
19: Annals of Pure and Applied Logic (context) - Girard, unity et al. - 1993
15: Dual Intuitionistic Linear Logic (context) - Barber - 1995
BibTeX entry: (Update)
K. Aehlig and H. Schwichtenberg. A syntactical analysis of non-size-increasing polynomial time computation. In Proceedings of the Fifteenth IEEE Symposium on Logic in Computer Science (LICS '00), June 2000. To appear. http://citeseer.ist.psu.edu/aehlig00syntactical.html More
@inproceedings{ aehlig00syntactical,
author = "Klaus Aehlig and Helmut Schwichtenberg",
title = "A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation",
booktitle = "Logic in Computer Science",
pages = "84-91",
year = "2000",
url = "citeseer.ist.psu.edu/aehlig00syntactical.html" }
Citations (may not include all citations):96 A new recursion-theoretic characterization of the polytime f.. (context) - Bellantoni, Cook - 1992 ACM DBLP
58 Linear types and non-size-increasing polynomial time computa.. - Hofmann - 1999 ACM DBLP
38 Ramified recurrence and computational complexity I: Word rec.. (context) - Leivant - 1995
26 Lambda calculus characterization of poly-- time (context) - Leivant, Marion - 1993
6 Short Proofs of Normalization for the simply-typed -calculus (context) - Joachimski, Matthes - 1998
4 Typed lambda calculi for polynomial-time computation (context) - Hofmann - 1998
3 antoni, Karl-Heinz Niggl, and Helmut Schwichtenberg. Higher .. (context) - Bell
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mathematik.uni-muenchen.de/personen/schwichtenberg.html):
Refined Program Extraction from Classical Proofs: Some Case.. - Schwichtenberg (1999) (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