Journal: Theoretical Computer Science

Volume 90, Issue 2

271 -- 308Teodor Rus. Algebraic Construction of Compliers
309 -- 353Makoto Tatsuta. Program Synthesis Using Realizability
355 -- 367Takashi Saito. Dynamics of Equivalence Relations in Automata Networks
369 -- 390Yoshihito Toyama. How to Prove Equivalence of Term Rewriting Systems Without Induction
391 -- 432Guozhu Dong, Seymour Ginsburg. Localizable Constraints for Object Histories
433 -- 456Dimiter Vakarelov. Modal Logics for Knowledge Representation Systems

Volume 90, Issue 1

1 -- 15Donald E. Knuth. Theory and Practice
17 -- 36Igor V. Pottosin. Analysis of Program Optimization Possibilities and Further Development
37 -- 46Victor N. Kasyanov. Transformational Approach to Program Concretization
47 -- 60Mikhail A. Bulyonkov. From Partial Evaluation to Mixed Computation
61 -- 79Yoshihiko Futamura, Kenroku Nogi, Akihiko Takano. Essence of Generalized Partial Computation
81 -- 93V. E. Itkin. An Algebra of Mixed Computation
95 -- 118Neil D. Jones. Static Semantics, Types, and Binding Time Analysis
119 -- 125Wladyslaw M. Turski. Prescribing Behaviors
127 -- 149J. W. de Bakker, J. H. A. Warmerdam. Four Domains for Concurrency
151 -- 170Ludmila Cherkasova, Vadim E. Kotov. An Algebra of Concurrent Non-Deterministic Processes
171 -- 184Antoni W. Mazurkiewicz, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot. Connectedness and Synchronization
185 -- 198Enn Tyugu. Higher Order Dataflow Schemas
199 -- 208J. M. Barzdin, G. J. Barzdin. Rapid Constructions of Algebraic Axioms From Samples
209 -- 233Andrzej Blikle, Andrzej Tarlecki, Mikkel Thorup. On Conservative Extensions of Syntax in System Development
235 -- 251C. A. R. Hoare. A Theory for the Derivation of Combinational C-MOS Circuit Designs
253 -- 270N. N. Nepejvoda. A Bridge Between Constructive Logic and Computer Programming