Skip to main content
SpringerLink
Log in

International Symposium on Theoretical Programming

  • Conference proceedings
  • © 1974

Overview

Editors:
  1. Andrei Ershov
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Valery A. Nepomniaschy
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (24 papers)

  1. Front Matter

    Download chapter PDF

  2. An axiomatic definition of the programming language PASCAL

    • C. A. R. Hoare
    Pages 1-16

  3. The logic of "can do"

    • Erwin Engeler
    Pages 17-28

  4. Copying in commutation — Operator schemata

    • M. I. Schwartzman
    Pages 29-55

  5. On synthesizing programs given by examples

    • J. Barzdin
    Pages 56-63

  6. Central technical issues in programming language design

    • J. Schwartz
    Pages 64-75

  7. Sur quelques systémes de programmation pour les recherches scientifiques

    • A. A. Liapounov
    Pages 76-84

  8. Decision problems in computational models

    • Michael S. Paterson
    Pages 85-85

  9. Non-determined algorithm schemata or R-schemata

    • R. I. Podlovchenko
    Pages 86-110

  10. Equivalence and optimization of programs

    • A. A. Letichevsky
    Pages 111-123

  11. On the average speed of automaton with terminal state

    • Ju. H. Shukurian
    Pages 124-126

  12. Logical-termal equivalence of program schemata

    • V. E. Itkin
    Pages 127-143

  13. On universal classes of program schemas

    • B. A. Trachtenbrot
    Pages 144-151

  14. Certain decompositions of Gödel numbering and the semantics of programming languages

    • B. Buchberger
    Pages 152-171

  15. Criteria for the algorithmic completeness of the systems of operations

    • V. A. Nepomniaschy
    Pages 172-186

  16. Data flow schemas

    • J. B. Dennis, J. B. Fosseen, J. P. Linderman
    Pages 187-216

  17. Operation patterns

    • A. Bährs
    Pages 217-246

  18. Looking for an approach to a theory of models for parallel computation

    • A. S. Narinyani
    Pages 247-284

  19. Configurable computers: A new class of general purpose machines

    • Raymond E. Miller, John Cocke
    Pages 285-298

  20. A method for determining program data relationships

    • F. E. Allen
    Pages 299-308
Back to top

Keywords

Bibliographic Information

  • Book Title: International Symposium on Theoretical Programming

  • Editors: Andrei Ershov, Valery A. Nepomniaschy

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-06720-5

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1974

  • Softcover ISBN: 978-3-540-06720-7Published: 06 May 1974

  • eBook ISBN: 978-3-540-38012-2Published: 30 June 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VIII, 407

  • Topics: Logics and Meanings of Programs

Publish with us

Policies and ethics

Back to top

Search

Navigation