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=139
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On Gabbay's temporal fixed point operator
Ian Hodkinson
Theoretical Computer Science
139
(1-2), 1995, pp. 1-25
Fundamental study: On Gabbay's temporal fixed point operator
Ian Hodkinson
Theoretical Computer Science
139
(1-2), 1995, pp. 1-25
On the logic of UNITY
Peter Päppinghaus
Theoretical Computer Science
139
(1-2), 1995, pp. 27-67
Fundamental Study: On the logic of UNITY
Peter Päppinghaus
Theoretical Computer Science
139
(1-2), 1995, pp. 27-67
Fundamental study: Strong categorical datatypes II: A term logic for categorical programming
J. Robin B. Cockett
,
Dwight Spencer
Theoretical Computer Science
139
(1-2), 1995, pp. 69-113
Nonsymmetric -autonomous categories
Michael Barr
Theoretical Computer Science
139
(1-2), 1995, pp. 115-130
Divergence of
F_{\leq}
type checking
Giorgio Ghelli
Theoretical Computer Science
139
(1-2), 1995, pp. 131-162
Sharing out control in distributed processes
Anne Bergeron
Theoretical Computer Science
139
(1-2), 1995, pp. 163-186
Studying equivalences of transition systems with algebraic tools
Pasquale Malacaria
Theoretical Computer Science
139
(1-2), 1995, pp. 187-205
A combinatory logic approach to higher-order
E
-unification
Daniel J. Dougherty
,
Patricia Johann
Theoretical Computer Science
139
(1-2), 1995, pp. 207-242
Computable concurrent processes
Yiannis N. Moschovakis
Theoretical Computer Science
139
(1-2), 1995, pp. 243-273
Observational specifications and the indistinguishability assumption
Gilles Bernot
,
Michel Bidoit
,
Teodor Knapik
Theoretical Computer Science
139
(1-2), 1995, pp. 275-314
Deciding observational congruence of finite-state
CCS
expressions by rewriting
P. Inverardi
,
M. Nesi
Theoretical Computer Science
139
(1-2), 1995, pp. 315-354
Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
Andreas Weiermann
Theoretical Computer Science
139
(1-2), 1995, pp. 355-362