default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6. Symposium on Programming 1984: Toulouse, France
- Manfred Paul, Bernard J. Robinet:
International Symposium on Programming, 6th Colloquium, Toulouse, France, April 17-19, 1984, Proceedings. Lecture Notes in Computer Science 167, Springer 1984, ISBN 3-540-12925-1 - André Arnold, Pascal Guitton:
Un modèle de description de protocoles: les reéseaux fermés d'atuomates triphasés. 1-12 - H. Bahsoun, Claude Bétourné, Louis Féraud:
Une expression de la synchronisatin et de l'oronnancement des processus concurrents par variables partagées. 13-22 - Patrick Bellot:
Sémantiques comparées des systeèmes de programmation fonctioneele FP et FFP de J. W. Backus. 23-34 - Alain Bossavit:
Le type abstrait vecteur et les méthodes de programmation des ordinateurs vectoriels. 35-46 - Vincenza Carchiolo
, Alberto Faro, F. Minissale, Giuseppe Scollo:
Some Topics in the Design of the Specification Language Lotos. 47-58 - Ana R. Cavalli, Luis Fariñas del Cerro:
Specification and Verification of Networks Protocols Using. 59-73 - Pierre Cointe:
Ue implémentation des coroutines en Lisp, application à Smalltalk. 74-88 - J. C. Cottet, Claude Renvoise, D. Sciamma:
Vesta: Vectorisation automatique et paramétrée de programmes. 89-100 - J. Finet, Patrick Sallé:
L'inclusion de filtres: une approche de la création d'environnements symboliquesen Plasma. 101-112 - Paul Feautrier:
Projet Vesta: outil de calcul symbolique. 113-124 - Jeanne Ferrante, Karl J. Ottenstein, Joe D. Warren:
The program Dependence Graph and its Use in Optimization. 125-132 - Pedro Guerreiro:
Implementations of Nondeterministic Programs. 133-144 - Stephan Heilbrunner, Lothar Schmitz:
For Statements with Restricted Enumerations. 145-154 - Ryszard Janicki:
A Method for Developing Concurrent Systems. 155-166 - Martin Jourdan:
An Optimal-time Recursive Evaluator for Attribute Grammars. 167-178 - Maciej Koutny:
On the Merlin-Randell Problem of Train Journeys. 179-190 - Eric Madelaine:
Un système d'aide à la preuve de compilateurs. 191-205 - Silvio Romero de Lemos Meira:
Optimized Combinatoric Code for Applicative Language Implementation. 206-216 - Alan Mycroft:
Polymorphic Type Schemes and Recursive Definitions. 217-228 - M. W. Shields:
Non-Sequential Behaviour. 229-239 - Morris M. Siegel:
Proving Properties of SNOBOL 4 Patterns: Selecting the Assertion Format. 240-250 - Scott A. Smolka:
Polynomial-Time Analysis for a Class of Communicating processes. 250-262
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
