Formalization of Programming Concepts: International Colloquium, Peniscola, Spain, April 19-25, 1981. ProceedingsJ. Diaz, I. Ramos |
Contents
FUNCTION LEVEL REASONING LINEAR EQUATIONS AND EXTENDED DEFINITIONS | 1 |
The VDM Principles of SOFTWARE SPECIFICATION PROGRAM DESIGN | 44 |
THEORY and APPLICATIONS | 75 |
A SURVEY | 96 |
FORMAL BEHAVIOURAL SPECIFICATION OF CONCURRENT SYSTEMS WITHOUT GLOBALITY ASSUMPTIONS | 115 |
A BIRKHOFFLIKE THEOREM FOR ALGEBRAIC CLASSES OF INTERPRETATIONS OF PROGRAM SCHEMES | 152 |
BUILDING DATA BASE MANAGEMENT SYSTEMS THROUGH FORMAL SPECIFICATION | 169 |
REDUCING TYPES IN APPLICATIVE LANGUAGES WITH STRUCTURED DATA | 210 |
RELATIONAL SEMANTICS OF STRONGLY COMMUNICATING SEQUENTIAL PROCESSES | 310 |
A CONSTRUCTION OP CONCURRENT SYSTEMS BY MEANS OF SEQUENTIAL SOLUTIONS AND CONCURRENCY RELATIONS | 327 |
THE DEVELOPMENT OF AN INTERPRETER BY MEANS OF ABSTRACT ALGEBRAIC SOFTWARE SPECIFICATIONS | 335 |
A FORMAL MODEL OF AN INTERPRETER FOR NONPROCEDURAL LANGUAGES | 347 |
Proof theoretic methodology for Prepositional Dynamic Logic | 356 |
FP SYSTEMS IN EDINBURGH LGF | 374 |
A PROPOSAL FOR OPERATIONAL SEMANTICS AND EQUIVALENCE OF FINITE ASYNCHRONOUS PROCESSES | 387 |
AN EXTENSION TO HORN CLAUSE LOGIC ALLOWING THE DEFINITION OF CONCURRENT PROCESSES | 401 |
ON THE DEFINITION OF LAMBDACALCULUS MODELS | 218 |
ABOUT DATA TYPE GENERICITY | 231 |
ON THE ALGEBRAIC EXTENSIONS OF ABSTRACT DATA TYPES | 244 |
A Model of Nondeterminate Computation | 252 |
An Operational Semantics for a Language with Early Completion Data Structures | 260 |
LE CALCUL DES FERMETURES DANS LES LAMBDALANGAGES | 268 |
DISTRIBUTED TERMINATION WITH INTERVAL ASSERTIONS | 280 |
ALGEBRAIC DENOTATIONAL SEMANTICS USING PARAMETERIZED ABSTRACT MODULES | 292 |
A SEMANTIC ALGEBRA FOR BINDING CONSTRUCTS | 408 |
ON THE REPRESENTATION OF DATA TYPES | 419 |
AN APPROACH TO COMMUNICATIONS AND PARALLELISM IN APPLICATIVE LANGUAGES | 432 |
USING LEAST FIXED POINTS TO CHARACTERIZE FORMAL COMPUTATIONS OF NONDETERMINISTIC EQUATIONS | 447 |
FORMAL REPRESENTATIONS FOR RECURSIVELY DEFINED FUNCTIONAL PROGRAMS | 460 |
PETRI NETS AND CONCURRENCYLIKE RELATIONS | 471 |
Other editions - View all
Formalization of Programming Concepts: International Colloquium, Peniscola ... J. Diaz,I. Ramos No preview available - 1981 |
Common terms and phrases
abstract data types algebraic semantics algorithm application Ardb attribute grammars axioms basic behaviour BOOL class of interpretations command communicating sequential process communication compiler Computer Science concepts concurrent condition construction constructor context corresponding COSY data base system defined definition denotational semantics derived domain element environment equations equivalent eval evaluation example execution expressions extended external finite formal function functional programming given Goguen graph implementation induction initial algebra input integer least fixed point lemma mapping node notation notion object operational semantics operations output pair paper path Petri nets predicate primitive Proc programming language proof properties prove queue recursive regular expressions relation representation rules satisfies schemes semantic algebra sequence sequential specification structure syntactic syntax termination theorem theory tion transformation tree tuples update variables