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=111
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computational interpretations of linear logic
Samson Abramsky
Theoretical Computer Science
111
(1-2), 1993, pp. 3-57
Power domains and second-order predicates
Reinhold Heckmann
Theoretical Computer Science
111
(1-2), 1993, pp. 59-88
On stable domains
Manfred Droste
Theoretical Computer Science
111
(1-2), 1993, pp. 89-101
Stable domains are generalized topological spaces
François Lamarche
Theoretical Computer Science
111
(1-2), 1993, pp. 103-123
Complete proof rules for strong fairness and strong extreme fairness
Michael G. Main
Theoretical Computer Science
111
(1-2), 1993, pp. 125-143
Comparing Hagino's categorical programming language and typed lambda-calculi
Hans Dybkjær
,
Austin Melton
Theoretical Computer Science
111
(1-2), 1993, pp. 145-189
Modal logic and algebraic specifications
Lawrence S. Moss
,
Satish R. Thatte
Theoretical Computer Science
111
(1-2), 1993, pp. 191-210
A logic for category theory
Paul C. Gilmore
,
George K. Tsiknis
Theoretical Computer Science
111
(1-2), 1993, pp. 211-252
Logical foundations for programming semantics
Paul C. Gilmore
,
George K. Tsiknis
Theoretical Computer Science
111
(1-2), 1993, pp. 253-290