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=87
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algebraic and fixed point equations over inverse limits of algebras
Viggo Stoltenberg-Hansen
,
J.V. Tucker
Theoretical Computer Science
87
, 1991, pp. 1-24
Simple second-order languages for which unification is undecidable
William M. Farmer
Theoretical Computer Science
87
, 1991, pp. 25-41
Control machines: A new model of parallelism for compositional specifications and their effective compilation
A.G. Heibig
Theoretical Computer Science
87
, 1991, pp. 43-80
Subtyping can have a simple semantics
Herman Balsters
,
Maarten M. Fokkinga
Theoretical Computer Science
87
, 1991, pp. 81-96
The equivalence in the DCP model
Reine Fournier
,
Gregor von Bochmann
Theoretical Computer Science
87
, 1991, pp. 97-114
Partial inductive definitions
Lars Hallnäs
Theoretical Computer Science
87
, 1991, pp. 115-142
Data refinement of predicate transformers
Paul Gardiner
,
Carroll Morgan
Theoretical Computer Science
87
, 1991, pp. 143-162
Relation algebraic domain constructions
Hans Zierer
Theoretical Computer Science
87
, 1991, pp. 163-188
Determinism and non-determinism in PDL
Andreas Wilm
Theoretical Computer Science
87
, 1991, pp. 189-202
Weak completeness of type assignment in
\lambda
-calculus models: A generalization of Hindley's result
M. Mezghiche
Theoretical Computer Science
87
, 1991, pp. 203-208
Co-induction in relational semantics
Robin Milner
,
Mads Tofte
Theoretical Computer Science
87
, 1991, pp. 209-220
The absence and the presence of fixed point combinators
William McCune
,
Larry Wos
Theoretical Computer Science
87
, 1991, pp. 221-228
Results on homomorphic realization of automata by
\alpha_0
-products
Zoltán ésik
Theoretical Computer Science
87
, 1991, pp. 229-249
On optimal parallel computations for sequences of brackets
Krzysztof Diks
,
Wojciech Rytter
Theoretical Computer Science
87
, 1991, pp. 251-262
A comparison between algebraic query languages for flat and nested databases
Marc Gyssens
,
Dirk van Gucht
Theoretical Computer Science
87
, 1991, pp. 263-286
On bounded interpretations of grammar forms
Erzsébet Csuhaj-Varjú
,
Jürgen Dassow
Theoretical Computer Science
87
, 1991, pp. 287-313
Finiteness and iteration conditions for semigroups
Aldo de Luca
,
Stefano Varricchio
Theoretical Computer Science
87
, 1991, pp. 315-327
Machine characterization of (EOL-EOL) array languages
Nalinakshi Nirmal
,
R. Rama
Theoretical Computer Science
87
, 1991, pp. 329-346
Relativized topological size of sets of partial recursive functions
Cristian Calude
Theoretical Computer Science
87
, 1991, pp. 347-352