Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDICFPC 1981: Peniscola, Spain
- Josep Díaz, Isidro Ramos:
Formalization of Programming Concepts, International Colloquium, Peniscola, Spain, April 19-25, 1981, Proceedings. Lecture Notes in Computer Science 107, Springer 1981, ISBN 3-540-10699-5
Invited Lectures
- John W. Backus:
The Algebra of Functional Programs: Function Level Reasoning, Linear Equations, and Extended Definitions. 1-43 - Dines Bjørner:
The VDM Principles of Software Specification and Program Design. 44-74 - Bruno Courcelle:
Attribute Grammars: Theory and Applications. 75-95 - Marie-Claude Gaudel:
Compiler Generation from Formal Definition of Programming Languages: A Survey. 96-114 - Peter E. Lauer, M. W. Shields, John Yiannis Cotronis:
Formal Behavioural Specification of Concurrent Systems Without Globality Assumptions. 115-151 - José Meseguer:
A Birkhoff-Like Theorem for Algebraic Classes of Interpretations of Program Schemes. 152-168 - Erich J. Neuhold, Thomas Olnhoff:
Building Data Base Management Systems Through Formal Specification. 169-209
Communications
- Egidio Astesiano, Gerardo Costa:
Reducing Types in Applicative Languages with Structured Data. 210-217 - Gérard Berry:
On the Definition of Lamda-Calculus Models. 218-230 - Didier Bert, Roger Soler:
About Data Type Genericity. 231-243 - Manfred Broy, Martin Wirsing:
On the Algebraic Extensions of Abstract Data Types. 244-251 - J. Dean Brock, William B. Ackerman:
Scenarios: A Model of Non-Determinate Computation. 252-259 - Jack B. Dennis:
An Operational Semantics for a Language with Early Completion Data Structures. 260-267 - Jean-Louis Durieux:
Le Calcul des Fermetures dans les Lamda-Langages. 268-279 - N. Frances, Michael Rodeh, Michel Sintzoff:
Distributed Termination with Interval Assertions. 280-291 - Joseph A. Goguen, Kamran Parsaye-Ghomi:
Algebraic Denotational Semantics Using Parameterized Abstract Modules. 292-309 - Pedro Guerreiro
:
Relational Semantics of Strongly Communicating Sequential Processes. 310-326 - Ryszard Janicki:
A Construction of Concurrent Systems by Means of Sequential Solutions and Concurrency Relations. 327-334 - Herbert Klaeren, Heiko Petzsch:
The Development of an Interpreter by Means of Abstract Algebraic Software Specifications. 335-346 - Juan M. Lafuente:
A Formal Model of an Interpreter for Nonprocedural Languages. 347-355 - Daniel Leivant:
A Proof Theoretic Methodology for Propositional Dynamic Logic. 356-373 - Jacek Leszczylowski:
FP Systems in Edinburgh LCF. 374-386 - Luis Mejia:
A Proposal for Operational Semantics and Equivalence of Finite Asynchronous Processes. 387-400 - Luís Monteiro:
An Extension to Horn Clause Logic Allowing the Definition of Concurrent Processes. 401-407 - Peter D. Mosses:
A Semantic Algebra for Binding Constructs. 408-418 - Fernando Orejas:
On the Representation of Data Types. 419-431 - Alberto Pettorossi:
An Approach to Communications and Parallelism in Applicative Languages. 432-446 - Axel Poigné:
Using Last Fixed Points to Characterize Formal Computations of Non-Deterministic Equations. 447-459 - John H. Williams:
Formal Representations for Recursively Defined Functional Programs. 460-470 - Piotr W. Prószynski:
Petri Nets and Concurrency-Like Relations. 471-478
a service of 
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 2024-05-13 20:14 CEST 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:
