|
2
|
recurrence and computational complexity I: Word recurrence and poly-time, Feasible Mathematics
– Ramified
- 1995
|
|
3
|
of computability at higher types I, Logic Colloquium 2000
– Notions
- 2005
|
|
2
|
considered as a programming language, Theoretical Computer Science 5
– LCF
- 1977
|
|
3
|
Formal Semantics
– G Winskel
- 1993
|
|
7
|
On the Complexity of Higher-Order Programs
– J Shultis
- 1985
|
|
12
|
Semantic Frameworks for Complexity
– D Gurr
- 1991
|
|
3
|
On the ubiquity of certain total type structures, extended abstract
– J R Longley
- 2005
|
|
19
|
Programming languages capturing complexity classes
– M Hofmann
|
|
10
|
Feasible computation in higher types
– B Kapron
- 1991
|
|
13
|
Linear types and non-size increasing polynomial time computation
– Martin Hofmann
- 2000
|
|
33
|
Control operators, the SECD-machine, and the lambda-calculus
– M Felleisen, D P Friedman
- 1986
|
|
6
|
Characterising polytime through higher type recursion
– S Bellantoni, K-H Niggl, H Schwichtenberg
- 2000
|
|
14
|
B.M.: On characterizations of the basic feasible functionals
– R J Irwin, J S Royer, Kapron
- 2001
|
|
9
|
Subrecursive programming systems
– J Royer, J Case
- 1994
|
|
7
|
Lambda Calculus characterizations of poly-time, Fundamenta Informaticae
– J-Y Marion D Leivant
- 1993
|
|
4
|
Recognition of polynomial-time programs
– C C Frederiksen, N D Jones
- 2004
|
|
35
|
A New Characterization Of Type 2 Feasibility
– Kapron Cook, S. A. Cook
- 1996
|
|
27
|
A foundational delineation of poly-time
– D Leivant
- 1994
|
|
29
|
Polynomial and abstract subrecursive classes
– K Mehlhorn
- 1974
|
