Formalization of Programming Concepts: International Colloquium, Peniscola, Spain, April 19-25, 1981. Proceedings (Lecture Notes in Computer Science (107)) (English and French Edition)

The algebra of functional programs: Function level reasoning, linear equations, and extended definitions....Pages 1-43 The VDM principles of software specification & program design....Pages 44-74 Attribute grammars : Theory and applications....Pages 75-95 Compiler generation from formal definition of programming languages : A survey....Pages 96-114 Formal behavioural specification of concurrent systems without globality assumptions....Pages 115-151 A birkhoff-like theorem for algebraic classes of interpretations of program schemes....Pages 152-168 Building data base management systems through formal specification....Pages 169-209 Reducing types in applicative languages with structured data....Pages 210-217 On the definition of lambda-calculus models....Pages 218-230 About data type genericity....Pages 231-243 On the algebraic extensions of abstract data types....Pages 244-251 Scenarios: A model of non-determinate computation....Pages 252-259 An operational semantics for a language with early completion data structures....Pages 260-267 Le calcul des fermetures dans les lambda-langages....Pages 268-279 Distributed termination with interval assertions....Pages 280-291 Algebraic denotational semantics using parameterized abstract modules....Pages 292-309 Relational semantics of strongly communicating sequential processes....Pages 310-326 A construction of concurrent systems by means of sequential solutions and concurrency relations....Pages 327-334 The development of an interpreter by means of abstract algebraic software specifications....Pages 335-346 A formal model of an interpreter for nonprocedural languages....Pages 347-355 Proof theoretic methodology for propositional dynamic logic....Pages 356-373 FP systems in edinburgh LCF....Pages 374-386 A proposal for operational semantics and equivalence of finite asynchronous processes....Pages 387-400 An extension to horn clause logic allowing the definition of concurrent processes....Pages 401-407 A semantic algebra for binding constructs....Pages 408-418 On the representation of data types....Pages 419-431 An approach to communications and parallelism in applicative languages....Pages 432-446 Using least fixed points to characterize formal computations of non-deterministic equations....Pages 447-459 Formal representations for recursively defined functional programs....Pages 460-470 Petri nets and concurrency-like relations....Pages 471-478