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: Journal=Inf.~Comput. AND Volume=143
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Type inference for pure type systems
Paula Severi
Information and Computation
143
(1), 1998, pp. 1-23
Completeness and non-completeness results with respect to read-once projections
Beate Bollig
,
Ingo Wegener
Information and Computation
143
(1), 1998, pp. 24-33
An interpretation of typed objects into typed
\pi
-calculus
Davide Sangiorgi
Information and Computation
143
(1), 1998, pp. 34-73
Investigations on measure-one identification of classes of languages
Franco Montagna
Information and Computation
143
(1), 1998, pp. 74-107
Reflective relational machines
Serge Abiteboul
,
Christos H. Papadimitriou
,
V. Vianu
Information and Computation
143
(2), 1998, pp. 110-136
A note on complexity measures for inductive classes in constructive type theory
Robert L. Constable
Information and Computation
143
(2), 1998, pp. 137-153
A restricted second order logic for finite structures
Anuj Dawar
Information and Computation
143
(2), 1998, pp. 154-174
Light linear logic
Jean-Yves Girard
Information and Computation
143
(2), 1998, pp. 175-204
Computable Kripke models and intermediate logics
Hajime Ishihara
,
Bakhadyr Khoussainov
,
Anil Nerode
Information and Computation
143
(2), 1998, pp. 205-230
A constant-space sequential model of computation for first-order logic
Steven Lindell
Information and Computation
143
(2), 1998, pp. 231-250