default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Programming 1972: Novosibirsk, Russia
- Andrei P. Ershov, Valery A. Nepomniaschy:
International Sympoisum on Theoretical Programming, Novosibirsk, Russia, August 7-11, 1972, Proceedings. Lecture Notes in Computer Science 5, Springer 1974, ISBN 3-540-06720-5 - C. A. R. Hoare:
An axiomatic definition of the programming language PASCAL. 1-16 - Erwin Engeler:
The logic of "can do". 17-28 - M. I. Schwartzman:
Copying in commutation - operator schemata. 29-55 - Janis Barzdin:
On synthesizing programs given by examples. 56-63 - Jack Schwartz:
Central technical issues in programming language design. 64-75 - A. A. Liapounov:
Sur quelques systèmes de programmation pour les recherches scientifiques. 76-84 - Mike Paterson:
Decision problems in computational models. 85-85 - Rimma I. Podlovchenko:
Non- determined algorithm schemata or R- schemata. 86-110 - A. A. Letichervsky:
Equivalence and optimization of programs. 111-123 - Ju. H. Shukurian:
On the average speed of automation with terminal state. 124-126 - V. E. Itkin:
Local- termal equivalence of program schemata. 127-143 - B. A. Trachtenbrot:
On universal classes of program schemas. 144-151 - Bruno Buchberger:
Certain decompositions of Gödel numbering and the semantics of programming languages. 152-171 - Valery A. Nepomniaschy:
Criteria for the algorithmic completeness of the systems of operations. 172-186 - Jack B. Dennis, John B. Fosseen, John P. Linderman:
Data flow schemas. 187-216 - A. Bährs:
Operation patterns. 217-246 - Alexander S. Narin'yani:
Looking for an approach to a theory of models for parallel computation. 247-284 - Raymond E. Miller, John Cocke:
Configurable computers: a new class of general purpose machines. 285-298 - P. E. Allen:
A method for determining program data relationships. 299-308 - V. E. Kotov:
Towards automatical construction of parallel programs. 309-331 - Robin Milner:
A calculus for the mathematical theory of computation. 332-343 - Shigeru Igarashi:
Admissibility of fixed-point induction in first- order logic of typed theories. 344-383 - Takayasu Ito:
A formal approximation theory of semantic data types. 384-393 - Gregory S. Tseytin:
Some feature of a language for a proof- checking programming system. 394-407
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 2025-01-13 21:38 CET 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:
