The Expressive Power of Higher-order Types or, Life without CONS (2001)

Cached

Download Links

by Neil D. Jones
Citations:24 - 1 self

Documents Related by Co-Citation

179 A New Recursion-Theoretic Characterization Of The Polytime Functions – Stephen Bellantoni, Stephen Cook - 1992
69 Linear Types and Non-Size-Increasing Polynomial Time Computation – Martin Hofmann - 1998
56 Light Affine Logic – A. Asperti - 1998
616 Light Linear Logic – Jean-yves Girard
15 Characterizing complexity classes by higher type primitive recursive definitions – A Goerdt - 1992
13 TYPE SYSTEMS FOR POLYNOMIAL-TIME COMPUTATION – Martin Hofmann - 1999
36 A New Characterization Of Type 2 Feasibility – Kapron Cook, S. A. Cook - 1996
37 Computation Models and Function Algebras – P. Clote
605 The Definition of Standard ML (Revised – Robin Milner, Mads Tofte, Robert Harper, David Macqueen - 1997
176 The Size-Change Principle for Program Termination – Chin Soon Lee, Neil D. Jones, Amir M. Ben-amram - 2001
3 Adventures in time and space – Norman Danner, James, S. Royer - 2006
5 Recognition of polynomial-time programs – C Frederiksen, N Jones - 2004
88 Functional interpretations of feasibly constructive arithmetic – Stephen Cook, Alasdair Urquhart - 1993
11 A syntactical analysis of non-size-increasing polynomial time computation – Klaus Aehlig, Helmut Schwichtenberg - 2002
11 The strength of non-size increasing computation – Martin Hofmann - 2002
89 Dual intuitionistic linear logic – A Barber, G Plotkin - 1997
37 Stratified Functional Programs and Computational Complexity – Daniel Leivant - 1993
10 Computability over topological structures – Vasco Brattka - 2003
6 The methods of approximation and lifting in real computation – Manuel L Campagnolo, Kerry Ojakian - 2007