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=89
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Order-sorted completion: the many-sorted way
Harald Ganzinger
Theoretical Computer Science
89
, 1991, pp. 3-32
Decidable boundedness problems for sets of graphs generated by hyperedge-replacement
Annegret Habel
,
Hans-Jörg Kreowski
,
Walter Vogler
Theoretical Computer Science
89
, 1991, pp. 33-62
Horn clause programs with polymorphic types: semantics and resolution
Michael Hanus
Theoretical Computer Science
89
, 1991, pp. 63-106
Type checking with universes
Robert Harper
,
Robert Pollack
Theoretical Computer Science
89
, 1991, pp. 107-136
Metacircularity in the polymorphic
\lambda
-calculus
Frank Pfenning
,
Peter Lee
Theoretical Computer Science
89
, 1991, pp. 137-159
Local model checking in the modal mu-calculus
Colin Stirling
,
David Walker
Theoretical Computer Science
89
, 1991, pp. 161-177
Specification styles in distributed systems design and versification
Chris A. Vissers
,
Giuseppe Scollo
,
Marten Van Sinderen
,
Ed Brinksma
Theoretical Computer Science
89
, 1991, pp. 179-206
Complete systems of
{\cal B}
-rational identities
D. Krob
Theoretical Computer Science
89
, 1991, pp. 207-343