International Symposium on Programming
Editat de M. Paul, B. Robineten Limba Engleză Paperback – apr 1984
Preț: 320.72 lei
Preț vechi: 400.90 lei
-20%
Puncte Express: 481
Preț estimativ în valută:
56.67€ • 65.32$ • 49.48£
56.67€ • 65.32$ • 49.48£
Carte tipărită la comandă
Livrare economică 16-30 mai
Specificații
ISBN-13: 9783540129257
ISBN-10: 3540129251
Pagini: 272
Ilustrații: VI, 263 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.42 kg
Ediția:1984
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540129251
Pagini: 272
Ilustrații: VI, 263 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.42 kg
Ediția:1984
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.