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

Cached

Download Links

by Neil D. Jones
Citations:24 - 1 self

Active Bibliography

8 On lexicographic termination ordering with space bound certifications – G. Bonfante, J.-Y. Marion, J.-Y. Moyen - 2001
3 Computing on Structures – Serge Abiteboul, Victor Vianu
3 On Characterizations of the Basic Feasible Functionals Part II – Robert J. Irwin, et al. - 2002
1 Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures – O. Bournez, F. Cucker, P. Jacob«e De Naurois, J. -y. Marion - 2004
5 A Functional Language for Logarithmic Space – Peter Møller Neergaard - 2004
36 Fixpoint Logics, Relational Machines, and Computational Complexity – Serge Abiteboul, Moshe Y. Vardi, Victor Vianu - 1993
10 On Bounded Set Theory – Vladimir Yu. Sazonov
9 Tailoring Recursion for Complexity – Erich Grädel, Yuri Gurevich - 1995
5 An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction – Paris Kanellakis, Gerd Hillebrand, Harry Mairson - 1994
12 Functional Database Query Languages as Typed Lambda Calculi of Fixed Order (Extended Abstract) – Gerd G. Hillebrand, Paris C. Kanellakis - 1994
6 On the expressive power of simply typed and let-polymorphic lambda calculi – Gerd Hillebrand, Paris Kanellakis - 1996
25 Database Query Languages Embedded in the Typed Lambda Calculus – Gerd Hillebrand , Paris C. Kanellakis, Harry G. Mairson - 1993
2 Resource Control Graphs – Jean-yves Moyen
13 TYPE SYSTEMS FOR POLYNOMIAL-TIME COMPUTATION – Martin Hofmann - 1999
Impicit complexity over arbitrary . . . – Olivier Bournez, Felipe Cucker, Paulin Jacobé De Naurois, Jean-Yves Marion
24 Descriptive Complexity Theory over the Real Numbers – Erich Grädel, Klaus Meer - 1996
Realizability and implicit PTIME characterization – Aloïs Brunel, Aloïs Brunel
11 The Implicit Computational Complexity of Imperative Programming Languages – Lars Kristiansen - 2001
153 Logic and the Challenge of Computer Science – Yuri Gurevich - 1988