Theoretical Computer Science, Volume 70

Volume 70, Number 1, 1990

Eric G. Wagner: Algebras, Polynomials and Programs. 3-34
E. S. Bainbridge, Peter J. Freyd, Andre Scedrov, Philip J. Scott: Functorial Polymorphism. 35-64
Michael Barr: Fixed Points in Cartesian Closed Categories. 65-72
Stephen L. Bloom: A Note on Guarded Theories. 73-83
Philip S. Mulry: Categorical Fixed Point Semantics. 85-97
Hanne Riis Nielson, Flemming Nielson: Functional Completeness of the Mixed lambda-Calculus and Combinatory Logic. 99-126
Ana Pasztor: Recursive Programs and Denotational Semantics in Absolute Logics of Programs. 127-150
Claudia Böttinger: On Scott's Thesis for Domains of Information and Well-Quasi-Orderings. 151-158
Charles Wells: A Generalization of the Concept of Sketch. 159-178

Jerzy Tiuryn, David B. Benson: Fixed Points in Free Process Algebras, Part II. 179-192
Giuseppe Longo, Eugenio Moggi: A Category-Theoretic Characterization of Functional Completeness. 193-211
Géraud Sénizergues: A Characterisation of Deterministic Context-Free Languages by Means of Right-Congruences. 213-232
Achim Jung: Cartesian Closed Categories of Algebraic CPOs. 233-250
Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo: On Locally Presented Posets. 251-260
Alain Terlutte: Cyclic Rational Transductions and Polynomials of Rational Functions. 261-271
Jozef Vyskoc: Corrigendum: An O(n^lgk . 2^n/2) Time and O(k . 2^n/2) Space Algorithm for Certain NP-Complete Problems. 273-274 , ->TCS 51: 221-227 (1987)
Martín Abadi: Corrigendum: The Power of Temporal Proofs. 275 , ->TCS 65: 35-83 (1989)

Andrzej Ehrenfeucht, Grzegorz Rozenberg: Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms. 277-303
Andrzej Ehrenfeucht, Grzegorz Rozenberg: Theory of 2-Structures, Part II: Representation Through Labeled Tree Families. 305-342
Andrzej Ehrenfeucht, Grzegorz Rozenberg: Primitivity is Hereditary for 2-Structures. 343-358