Cantitate/Preț
Produs

International Symposium on Programming: 6th Colloquium, Toulouse, April 17-19, 1984. Proceedings: Lecture Notes in Computer Science, cartea 167

Editat de M. Paul, B. Robinet
en Limba Engleză Paperback – apr 1984

Din seria Lecture Notes in Computer Science

Preț: 32571 lei

Preț vechi: 40714 lei
-20% Nou

Puncte Express: 489

Preț estimativ în valută:
6235 6481$ 5170£

Carte tipărită la comandă

Livrare economică 07-21 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540129257
ISBN-10: 3540129251
Pagini: 272
Ilustrații: VI, 263 p.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.39 kg
Ediția:1984
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.