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=228
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bisimilarity as a theory of functional programming
Andrew D. Gordon
Theoretical Computer Science
228
(1-2), 1999, pp. 5-47
Bireflectivity
P.J. Freyd
,
P.W. O'Hearn
,
A.J. Power
,
M. Takeyama
,
R. Street
,
R.D. Tennent
Theoretical Computer Science
228
(1-2), 1999, pp. 49-76
Closed action calculi
Philippa Gardner
Theoretical Computer Science
228
(1-2), 1999, pp. 77-103
A fully abstract semantics for a higher-order functional language with nondeterministic computation
Alan Jeffrey
Theoretical Computer Science
228
(1-2), 1999, pp. 105-150
logspace and ptime characterized by programming languages
Neil D. Jones
Theoretical Computer Science
228
(1-2), 1999, pp. 151-174
Call-by-name, call-by-value, call-by-need and the linear lambda calculus
J. Maraist
,
M. Odersky
,
D.N. Turner
,
P. Wadler
Theoretical Computer Science
228
(1-2), 1999, pp. 175-210
Syntactic control of interference revisited
P.W. O'Hearn
,
A.J. Power
,
M. Takeyama
,
R.D. Tennent
Theoretical Computer Science
228
(1-2), 1999, pp. 211-252
Objects, interference, and the Yoneda embedding
Peter W. O'Hearn
,
Uday S. Reddy
Theoretical Computer Science
228
(1-2), 1999, pp. 253-282