International Symposium on Programming - nuovo libro

EAN (ISBN-13): 9783540388098
Editore: Springer Science+Business Media

Libro nella banca dati dal 2017-06-04T23:16:18+02:00 (Rome)
Pagina di dettaglio ultima modifica in 2021-08-28T07:54:52+02:00 (Rome)
ISBN/EAN: 9783540388098

ISBN - Stili di scrittura alternativi:
978-3-540-38809-8

---

Dati dell'editore

Autore: M. Paul; B. Robinet
Titolo: Lecture Notes in Computer Science; International Symposium on Programming - 6th Colloquium, Toulouse, April 17-19, 1984. Proceedings
Editore: Springer; Springer Berlin
263 Pagine
Anno di pubblicazione: 2005-06-30
Berlin; Heidelberg; DE
Lingua: Inglese
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
VI, 263 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Programmiersprachen; Compiler und Übersetzer; Verstehen; Attribut; Smalltalk; design; language; programming; verification; C; Compilers and Interpreters; Software Engineering; Computer Science; Software Engineering; BC

Un modele de description de protocoles : Les reseaux fermes d'automates triphases.- Une expression de la synchronisation et de l'Ordonnancement des processus concurrents par variables partagees.- Semantiques comparees des systemes de programmation fonctionnelle FP et FFP de J.W. Backus.- Le type abstrait "vecteur" et les methodes de programmation des ordinateurs vectoriels.- Some topics in the design of the specification language lotos.- Specification and verification of networks protocols using temporal logic.- Une implémentation des coroutines en Lisp, application à Smalltalk.- Vesta Vectorisation automatique et parametree de programmes.- L'Inclusion de filtres : Une approche de la creation d'environnements symboliques en Plasma.- Projet Vesta.- The program dependence graph and its use in optimization.- Implementations of nondeterministic programs.- For statements with restricted enumerations.- A method for developing concurrent systems.- An optimal-time recursive evaluator for attribute grammars.- On the Merlin-Randell problem of train journeys.- Un systeme d'aide a la preuve de compilateurs.- Optimized combinatoric code for applicative language implementation.- Polymorphic type schemes and recursive definitions.- Non-sequential behaviour.- Proving properties of Snobol4 patterns: Selecting the assertion format.- Polynomial-time analysis for a class of communicating processes.