|
5
|
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
|
|
3
|
A Functional Language for Logarithmic Space
– Peter Møller Neergaard
- 2004
|
|
33
|
Fixpoint Logics, Relational Machines, and Computational Complexity
– Serge Abiteboul, Moshe Y. Vardi, Victor Vianu
- 1993
|
|
10
|
On Bounded Set Theory
– Vladimir Yu. Sazonov
|
|
8
|
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
|
|
5
|
On the expressive power of simply typed and let-polymorphic lambda calculi
– Gerd Hillebrand, Paris Kanellakis
- 1996
|
|
23
|
Database Query Languages Embedded in the Typed Lambda Calculus
– Gerd Hillebrand , Paris C. Kanellakis, Harry G. Mairson
- 1993
|
|
|
Resource Control Graphs
– Jean-yves Moyen
|
|
10
|
TYPE SYSTEMS FOR POLYNOMIAL-TIME COMPUTATION
– Martin Hofmann
- 1999
|
|
23
|
Descriptive Complexity Theory over the Real Numbers
– Erich Grädel, Klaus Meer
- 1996
|
|
|
Realizability and implicit PTIME characterization
– Aloïs Brunel, Aloïs Brunel
|
|
9
|
The Implicit Computational Complexity of Imperative Programming Languages
– Lars Kristiansen
- 2001
|
|
149
|
Logic and the Challenge of Computer Science
– Yuri Gurevich
- 1988
|
|
7
|
Linear ordering on graphs, anti-founded sets and polynomial time computability
– Alexei Lisitsa, Vladimir Sazonov
- 1999
|
