Advertisement

Table of contents

  1. Front Matter
    PDF
  2. The algebra of functional programs: Function level reasoning, linear equations, and extended definitions
    John Backus
    Pages 1-43
  3. The VDM principles of software specification & program design
    Dines Bjørner
    Pages 44-74
  4. Attribute grammars : Theory and applications
    B. Courcelle
    Pages 75-95
  5. Compiler generation from formal definition of programming languages : A survey
    M. C. Gaudel
    Pages 96-114
  6. Formal behavioural specification of concurrent systems without globality assumptions
    P. E. Lauer, M. W. Shields, J. Y. Cotronis
    Pages 115-151
  7. A birkhoff-like theorem for algebraic classes of interpretations of program schemes
    José Meseguer
    Pages 152-168
  8. Building data base management systems through formal specification
    E. J. Neuhold, Th. Olnhoff
    Pages 169-209
  9. Reducing types in applicative languages with structured data
    E. Astesiano, G. Costa
    Pages 210-217
  10. On the definition of lambda-calculus models
    G. Berry
    Pages 218-230
  11. About data type genericity
    Didier Bert, Roger Soler
    Pages 231-243
  12. On the algebraic extensions of abstract data types
    Manfred Broy, Martin Wirsing
    Pages 244-251
  13. Scenarios: A model of non-determinate computation
    J. Dean Brock, William B. Ackerman
    Pages 252-259
  14. An operational semantics for a language with early completion data structures
    Jack B. Dennis
    Pages 260-267
  15. Le calcul des fermetures dans les lambda-langages
    Jean-Louis Durieux
    Pages 268-279
  16. Distributed termination with interval assertions
    N. Francez, M. Rodeh, M. Sintzoff
    Pages 280-291
  17. Algebraic denotational semantics using parameterized abstract modules
    Joseph A. Goguen, Kamran Parsaye-Ghomi
    Pages 292-309
  18. Relational semantics of strongly communicating sequential processes
    Pedro Guerreiro
    Pages 310-326
  19. A construction of concurrent systems by means of sequential solutions and concurrency relations
    Ryszard Janicki
    Pages 327-334
  20. The development of an interpreter by means of abstract algebraic software specifications
    H. A. Klaeren, H. Petzsch
    Pages 335-346
  21. A formal model of an interpreter for nonprocedural languages
    Juan M. Lafuente
    Pages 347-355
  22. Proof theoretic methodology for propositional dynamic logic
    Daniel Leivant
    Pages 356-373
  23. FP systems in edinburgh LCF
    Jacek Leszczyłowski
    Pages 374-386
  24. A proposal for operational semantics and equivalence of finite asynchronous processes
    Luis Mejia
    Pages 387-400
  25. An extension to horn clause logic allowing the definition of concurrent processes
    Luis Monteiro
    Pages 401-407
  26. A semantic algebra for binding constructs
    Peter Mosses
    Pages 408-418
  27. On the representation of data types
    F. Orejas
    Pages 419-431
  28. An approach to communications and parallelism in applicative languages
    Alberto Pettorossi
    Pages 432-446
  29. Using least fixed points to characterize formal computations of non-deterministic equations
    Axel Poigné
    Pages 447-459
  30. Formal representations for recursively defined functional programs
    John H. Williams
    Pages 460-470
  31. Petri nets and concurrency-like relations
    Piotr Prószyński
    Pages 471-478

About these proceedings

Keywords

Formale Sprache Programmierung (EDV) Programming data structure formal specification logic programming language semantics

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-10699-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 1981
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-10699-9
  • Online ISBN 978-3-540-38654-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site