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=70
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algebras, polynomials and programs
Eric G. Wagner
Theoretical Computer Science
70
, 1990, pp. 3-34
Functorial polymorphism
E.S. Bainbridge
,
P.J. Freyd
,
A. Scedrov
,
P.J. Scott
Theoretical Computer Science
70
, 1990, pp. 35-64
Fixed points in cartesian closed categories
Michael Barr
Theoretical Computer Science
70
, 1990, pp. 65-72
A note on guarded theories
Stephen L. Bloom
Theoretical Computer Science
70
, 1990, pp. 73-83
Categorical fixed point semantics
Philip S. Mulry
Theoretical Computer Science
70
, 1990, pp. 85-97
Functional completeness of the mixed
\lambda
-calculus and combinatory logic
Hanne Riis Nielson
,
Flemming Nielson
Theoretical Computer Science
70
, 1990, pp. 99-126
Recursive programs and denotational semantics in absolute logics of programs
Ana Pasztor
Theoretical Computer Science
70
, 1990, pp. 127-150
On Scott's thesis for domains of information and well-quasi-orderings
Claudia Böttinger
Theoretical Computer Science
70
, 1990, pp. 151-158
A generalization of the concept of sketch
Charles Wells
Theoretical Computer Science
70
, 1990, pp. 159-178
Fixed points in free process algebras, Part II
Jerzy Tiuryn
,
David B. Benson
Theoretical Computer Science
70
, 1990, pp. 179-192
A category-theoretic characterization of functional completeness
Giuseppe Longo
,
Eugenio Moggi
Theoretical Computer Science
70
, 1990, pp. 193-211
A characterisation of deterministic context-free languages by means of right-congruences
Géraud Sénizergues
Theoretical Computer Science
70
, 1990, pp. 213-232
Cartesian closed categories of algebraic CPOs
Achim Jung
Theoretical Computer Science
70
, 1990, pp. 233-250
On locally presented posets
Giorgio Gambosi
,
Jaroslav Nes̑etȓil
,
Maurizio Talamo
Theoretical Computer Science
70
, 1990, pp. 251-260
Cyclic rational transductions and polynomials of rational functions
Alain Terlutte
Theoretical Computer Science
70
, 1990, pp. 261-271
Theory of 2-structures, part I: Clans, basic subclasses, and morphisms
A. Ehrenfeucht
,
G. Rozenberg
Theoretical Computer Science
70
, 1990, pp. 277-303
Theory of 2-structures, part II: Representation through labeled tree families
A. Ehrenfeucht
,
G. Rozenberg
Theoretical Computer Science
70
, 1990, pp. 305-342
Primitivity is hereditary for 2-structures
A. Ehrenfeucht
,
G. Rozenberg
Theoretical Computer Science
70
, 1990, pp. 343-358