Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 90
Volume 90, Number 1, 1991
- Donald E. Knuth:
Theory and Practice. 1-15 - Igor V. Pottosin:
Analysis of Program Optimization Possibilities and Further Development. 17-36 - Victor N. Kasyanov:
Transformational Approach to Program Concretization. 37-46 - Mikhail A. Bulyonkov:
From Partial Evaluation to Mixed Computation. 47-60 - Yoshihiko Futamura, Kenroku Nogi, Akihiko Takano:
Essence of Generalized Partial Computation. 61-79 - V. E. Itkin:
An Algebra of Mixed Computation. 81-93 - Neil D. Jones:
Static Semantics, Types, and Binding Time Analysis. 95-118 - Wladyslaw M. Turski:
Prescribing Behaviors. 119-125 - J. W. de Bakker, J. H. A. Warmerdam:
Four Domains for Concurrency. 127-149 - Ludmila Cherkasova, Vadim E. Kotov:
An Algebra of Concurrent Non-Deterministic Processes. 151-170 - Antoni W. Mazurkiewicz, Alexander Moshe Rabinovich
, Boris A. Trakhtenbrot:
Connectedness and Synchronization. 171-184 - Enn Tyugu:
Higher Order Dataflow Schemas. 185-198 - J. M. Barzdin, G. J. Barzdin:
Rapid Constructions of Algebraic Axioms From Samples. 199-208 - Andrzej Blikle, Andrzej Tarlecki, Mikkel Thorup:
On Conservative Extensions of Syntax in System Development. 209-233 - C. A. R. Hoare:
A Theory for the Derivation of Combinational C-MOS Circuit Designs. 235-251 - N. N. Nepejvoda:
A Bridge Between Constructive Logic and Computer Programming. 253-270
Volume 90, Number 2, 1991
- Teodor Rus:
Algebraic Construction of Compliers. Theor. Comput. Sci. 90(2): 271-308 (1991) - Makoto Tatsuta:
Program Synthesis Using Realizability. Theor. Comput. Sci. 90(2): 309-353 (1991) - Takashi Saito:
Dynamics of Equivalence Relations in Automata Networks. Theor. Comput. Sci. 90(2): 355-367 (1991) - Yoshihito Toyama:
How to Prove Equivalence of Term Rewriting Systems Without Induction. Theor. Comput. Sci. 90(2): 369-390 (1991) - Guozhu Dong, Seymour Ginsburg:
Localizable Constraints for Object Histories. Theor. Comput. Sci. 90(2): 391-432 (1991) - Dimiter Vakarelov:
Modal Logics for Knowledge Representation Systems. Theor. Comput. Sci. 90(2): 433-456 (1991)
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-17 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
