Skip to main content
Springer Nature Link
Log in

Mathematical Foundations of Computer Science 1991

16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991. Proceedings

  • Conference proceedings
  • © 1991

Overview

Editors:
  1. Andrzej Tarlecki
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 520)

Included in the following conference series:

Conference proceedings info: MFCS 1991.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers.

Similar content being viewed by others

Keywords

Table of contents (43 papers)

  1. Front Matter

    Download chapter PDF

  2. Elimination of negation in term algebras

    • J-L. Lassez, M. Maher, K. Marriott
    Pages 1-16

  3. Rewrite orderings and termination of rewrite systems

    • Pierre Lescanne
    Pages 17-27

  4. On the faithfulness of formal models

    • Zohar Manna, Amir Pnueli
    Pages 28-42

  5. Models for concurrency

    • Mogens Nielsen
    Pages 43-46

  6. On a hierarchy of file types and a tower of their theories

    • Andrzej Salwicki
    Pages 47-63

  7. Strong conjunction and intersection types

    • Fabio Alessi, Franco Barbanera
    Pages 64-73

  8. Partial higher-order specifications

    • Egidio Astesiano, Maura Cerioli
    Pages 74-83

  9. Unification in incompletely specified theories: A case study

    • Staffan Bonnier
    Pages 84-92

  10. Observing localities

    • G. Boudol, I. Castellani, M. Hennessy, A. Kiehn
    Pages 93-102

  11. Abstract dynamic data types: A temporal logic approach

    • Gerardo Costa, Gianna Reggio
    Pages 103-112

  12. Generating words by cellular automata

    • Anton Černý
    Pages 113-120

  13. Atomic refinement in process description languages

    • Pierpaolo Degano, Roberto Gorrieri
    Pages 121-130

  14. Recognizable complex trace languages (abstract)

    • Volker Diekert, Paul Gastin, Antoine Petit
    Pages 131-140

  15. Solving systems of linear diophantine equations: An algebraic approach

    • Eric Domenjoud
    Pages 141-150

  16. A second-order pattern matching algorithm for the cube of typed λ-calculi

    • Gilles Dowek
    Pages 151-160

  17. The lazy call-by-value λ-calculus

    • Lavinia Egidi, Furio Honsell, Simona Ronchi della Rocca
    Pages 161-169

  18. The limit of split n -bisimulations for CCS agents

    • Roberto Gorrieri, Cosimo Laneve
    Pages 170-180

  19. Stochastic automata and length distributions of rational languages

    • Georges Hansel, Daniel Krob, Christian Michaux
    Pages 181-190

  20. Towards a categorical semantics of type classes

    • Barney P. Hilken, David E. Rydeheard
    Pages 191-201
Back to top

Other volumes

  1. Mathematical Foundations of Computer Science 1991

Bibliographic Information

Publish with us

Policies and ethics

Back to top