Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Constable, Robert L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on complexity measures for inductive classes in constructive type theory
Robert L. Constable
Information and Computation
143
(2), 1998, pp. 137-153
The mathematics and mechanics of relating formal theories
Robert L. Constable
Technical Report, 1997
Experience using type theory as a foundation for computer science
Robert L. Constable
Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science (San Diego, California, June 26-29, 1995)
, 1995, pp. 266-279
Expressing computational complexity in constructive type theory
Robert L. Constable
Lecture Notes in Computer Science
960
, 1995, pp. 131-144
Computational foundations of basic recursive function theory
Robert L. Constable
,
Scott F. Smith
Theoretical Computer Science
121
(1-2), 1993, pp. 89-112
Subrecursive programming languages, part I: Efficiency and program structure
Robert L. Constable
,
Allan B. Borodin
Journal of the ACM
19
, 1972, pp. 526-568
Subrecursive programming languages II. On program size
Robert L. Constable
Journal of Computer and System Sciences
5
, 1971, pp. 315-334