|
4
|
Repr'esentation intentionelle d'algorithmes dans les syst`emes fonctionelles: une 'etude de cas, Th'ese de Doctorat, Universit'e Paris VII
– L Colson
- 1991
|
|
4
|
Une preuve directe du Th'eor`eme d'Ultime Obstination, Comptes Rendus de l'Academie des Sciences
– T Coquand
- 1992
|
|
3
|
Semantic Frameworks for Complexity, Doctoral Thesis
– D J Gurr
- 1991
|
|
11
|
Towards a theory of parallel algorithms on concrete data structures
– Stephen Brookes, Shai Geva
- 1990
|
|
24
|
Computational Comonads and Intensional Semantics
– Stephen Brookes, Shai Geva
- 1991
|
|
3
|
Programming with concrete data structures and sequential algorithms, in
– G Berry
- 1981
|
|
5
|
The kernel of the applicative language CDS: theory and practice
– G Berry, P-L Curien
- 1985
|
|
17
|
About primitive recursive algorithms
– L Colson
- 1989
|
|
30
|
Introduction to Metamathematics, North-Holland Publishing
– S C Kleene
- 1964
|
|
83
|
Sequential algorithms on concrete data structures
– G Berry, P-L Curien
- 1982
|
|
7
|
Time Analysis, Cost Equivalence and Program Refinement
– D Sands
- 1991
|
|
33
|
Strictness Analysis Aids Time Analysis
– Philip Wadler
- 1988
|
|
515
|
D.: Implementation of Functional Programming Languages
– Peyton Jones, S Lester
- 1987
|
|
47
|
Fully abstract semantics for observably sequential languages
– Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen
- 1994
|
|
76
|
Automatic complexity analysis
– M Rosendahl
- 1989
|
|
238
|
J.D.: Introduction to Automata Theory
– J E Hopcroft, R Motwani, Ullman
- 2006
|
|
11
|
Abstract recursion as a foundation for the theory of algorithms
– Y N Moschovakis
- 1984
|
|
7
|
A mathematical modeling of pure, recursive algorithms
– Yiannis N Moschovakis
- 1989
|
|
6
|
Rum: An intensional theory of function and control abstractions
– C Talcott
- 1986
|
