Formalization of Programming Concepts: International Colloquium, Peniscola, Spain, April 19-25, 1981. Proceedings |
What people are saying - Write a review
We haven't found any reviews in the usual places.
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
Common terms and phrases
abstract actions algebra algorithm allow application approach associated attribute basic called command communication compiler complete Computer concepts concurrent condition consider consists construction contains context continuous correct corresponding data base data types defined definition denote derived described distributed domain element equations equivalent evaluation example execution exists expressions extended external finite formal function give given grammars identifier implementation initial input interpretation introduced language linear logic mapping meaning method node notation Note notion object occurrence operations pair partial path possible present problem produce programming language proof properties prove recursive relation represent representation respectively restriction result rules satisfies semantics sequence simple sort specification structure syntactic syntax termination theorem theory tion transformation tree tuples variables
Bibliographic information
| Title | Formalization of Programming Concepts: International Colloquium, Peniscola, Spain, April 19-25, 1981. Proceedings Volume 107 of Lecture Notes in Computer Science, ISSN 0302-9743 |
| Editors | J. Diaz, I. Ramos |
| Edition | illustrated |
| Publisher | Springer Science & Business Media, 1981 |
| ISBN | 3540106995, 9783540106999 |
| Length | 478 pages |
| Subjects | › › Computers / Computer Science Computers / Information Technology Computers / Programming / General Computers / Software Development & Engineering / General |
| Export Citation | BiBTeX EndNote RefMan |