Formalization of Programming Concepts
International Colloquium, Peniscola, Spain, April 19-25, 1981. Proceedings
Published on 1. April 1981
Book
Paperback/Softback
X, 486 pages
978-3-540-10699-9 (ISBN)
Description
The algebra of functional programs: Function level reasoning, linear equations, and extended definitions.- The VDM principles of software specification & program design.- Attribute grammars : Theory and applications.- Compiler generation from formal definition of programming languages : A survey.- Formal behavioural specification of concurrent systems without globality assumptions.- A birkhoff-like theorem for algebraic classes of interpretations of program schemes.- Building data base management systems through formal specification.- Reducing types in applicative languages with structured data.- On the definition of lambda-calculus models.- About data type genericity.- On the algebraic extensions of abstract data types.- Scenarios: A model of non-determinate computation.- An operational semantics for a language with early completion data structures.- Le calcul des fermetures dans les lambda-langages.- Distributed termination with interval assertions.- Algebraic denotational semantics using parameterized abstract modules.- Relational semantics of strongly communicating sequential processes.- A construction of concurrent systems by means of sequential solutions and concurrency relations.- The development of an interpreter by means of abstract algebraic software specifications.- A formal model of an interpreter for nonprocedural languages.- Proof theoretic methodology for propositional dynamic logic.- FP systems in edinburgh LCF.- A proposal for operational semantics and equivalence of finite asynchronous processes.- An extension to horn clause logic allowing the definition of concurrent processes.- A semantic algebra for binding constructs.- On the representation of data types.- An approach to communications and parallelism in applicative languages.- Using least fixed points to characterize formal computations of non-deterministic equations.- Formal representations for recursively defined functional programs.- Petri nets and concurrency-like relations.
More details
Series
Edition
1981 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
X, 486 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 27 mm
Weight
739 gr
ISBN-13
978-3-540-10699-9 (9783540106999)
DOI
10.1007/3-540-10699-5
Schweitzer Classification
Content
The algebra of functional programs: Function level reasoning, linear equations, and extended definitions.- The VDM principles of software specification & program design.- Attribute grammars : Theory and applications.- Compiler generation from formal definition of programming languages : A survey.- Formal behavioural specification of concurrent systems without globality assumptions.- A birkhoff-like theorem for algebraic classes of interpretations of program schemes.- Building data base management systems through formal specification.- Reducing types in applicative languages with structured data.- On the definition of lambda-calculus models.- About data type genericity.- On the algebraic extensions of abstract data types.- Scenarios: A model of non-determinate computation.- An operational semantics for a language with early completion data structures.- Le calcul des fermetures dans les lambda-langages.- Distributed termination with interval assertions.- Algebraic denotational semantics using parameterized abstract modules.- Relational semantics of strongly communicating sequential processes.- A construction of concurrent systems by means of sequential solutions and concurrency relations.- The development of an interpreter by means of abstract algebraic software specifications.- A formal model of an interpreter for nonprocedural languages.- Proof theoretic methodology for propositional dynamic logic.- FP systems in edinburgh LCF.- A proposal for operational semantics and equivalence of finite asynchronous processes.- An extension to horn clause logic allowing the definition of concurrent processes.- A semantic algebra for binding constructs.- On the representation of data types.- An approach to communications and parallelism in applicative languages.- Using least fixed points to characterize formal computations of non-deterministic equations.- Formal representations for recursively defined functional programs.- Petri nets and concurrency-like relations.