International symposium on theoretical programming
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | , |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
2005.
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
5 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • International symposium on theoretical programming, [held in Novosibirsk on August 7-11, 1972], edited by Andrei Ershov and Valery A. Nepomniaschy, Berlin, 1974, 1 vol. (p. 2-407), Lecture notes in computer science, 3-540-06720-5 • International Symposium on Theoretical Programming, Texte imprimé, 9783662169377 |
Sommario:
- An axiomatic definition of the programming language PASCAL
- The logic of "can do"
- Copying in commutation Operator schemata
- On synthesizing programs given by examples
- Central technical issues in programming language design
- Sur quelques systémes de programmation pour les recherches scientifiques
- Decision problems in computational models
- Non-determined algorithm schemata or R-schemata
- Equivalence and optimization of programs
- On the average speed of automaton with terminal state
- Logical-termal equivalence of program schemata
- On universal classes of program schemas
- Certain decompositions of Gödel numbering and the semantics of programming languages
- Criteria for the algorithmic completeness of the systems of operations
- Data flow schemas
- Operation patterns
- Looking for an approach to a theory of models for parallel computation
- Configurable computers: A new class of general purpose machines
- A method for determining program data relationships
- Towards automatical construction of parallel programs
- A calculus for the mathematical theory of computation
- Admissibility of fixed-point induction in first-order logic of typed theories
- A formal approximation theory of semantic data types
- Some features of a language for a proof-checking programming system.