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=Theor.~Comput.~Sci. AND Volume=227
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Full abstraction for idealized Algol with passive expressions
Samson Abramsky
,
Guy McCusker
Theoretical Computer Science
227
(1-2), 1999, pp. 3-42
A classical linear
\lambda
-calculus
G.M. Bierman
Theoretical Computer Science
227
(1-2), 1999, pp. 43-78
Reversible, irreversible and optimal
\lambda
-machines
Vincent Danos
,
Laurent Regnier
Theoretical Computer Science
227
(1-2), 1999, pp. 79-97
A general theory of sharing graphs
Stefano Guerrini
Theoretical Computer Science
227
(1-2), 1999, pp. 99-151
Coherence completions of categories
Hongde Hu
,
Andre Joyal
Theoretical Computer Science
227
(1-2), 1999, pp. 153-184
Distributed concurrent linear logic programming
Naoki Kobayashi
,
Toshihiro Shimizu
,
Akinori Yonezawa
Theoretical Computer Science
227
(1-2), 1999, pp. 185-220
Polynomial equivalence among systems LLNC, LLNC
_a
and LLNC
_0
François Métayer
Theoretical Computer Science
227
(1-2), 1999, pp. 221-229
Operational interpretations of linear logic
David N. Turner
,
Philip Wadler
Theoretical Computer Science
227
(1-2), 1999, pp. 231-248
On denotational completeness
Jean-Yves Girard
Theoretical Computer Science
227
(1-2), 1999, pp. 249-273
Coherent Banach spaces: A continuous denotational semantics
Jean-Yves Girard
Theoretical Computer Science
227
(1-2), 1999, pp. 275-297
Optimization complexity of linear logic proof games
Patrick D. Lincoln
,
John C. Mitchell
,
Andre Scedrov
Theoretical Computer Science
227
(1-2), 1999, pp. 299-331
Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic
Mitsuhiro Okada
Theoretical Computer Science
227
(1-2), 1999, pp. 333-396