Skip to main content
SpringerLink
Log in
Book cover

Mathematical Foundations of Computer Science 1980

9th Symposium Held in Rydzyna, Poland, September 1-5, 1980. Proceedings

  • Conference proceedings
  • © 1980

Overview

Editors:
  1. P. Dembiński
    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 88)

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 69.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

Table of contents (53 papers)

  1. Front Matter

    Download chapter PDF

  2. Formal description of programming concepts

    • Dines Bjørner
    Pages 1-21

  3. Electronic category theory

    • R. M. Burstall
    Pages 22-39

  4. An essay about research on sparse NP complete sets

    • J. Hartmanis, S. R. Mahaney
    Pages 40-57

  5. Some theoretical aspects of applicative multiprocessing

    • Robert M. Keller
    Pages 58-74

  6. On some discrete optimization problems in mass storage systems

    • C. K. Wong
    Pages 75-93

  7. Abstract data types: A retrospective and prospective view

    • Wm. A. Wulf
    Pages 94-112

  8. Controlling behaviours of systems : Some basic concepts and some applications

    • A. Arnold, M. Nivat
    Pages 113-122

  9. Conceptual relations between databases transformed under join and projection

    • G. Ausiello, C. Batini, M. Moscarini
    Pages 123-136

  10. The weighted Sperner's Set problem

    • X. Berenguer, J. Diaz
    Pages 137-141

  11. Proof of a concurrent program finding Euler paths

    • E. Best
    Pages 142-153

  12. A theoretical basis for the systematic proof method

    • Wolfgang Bibel
    Pages 154-167

  13. Consistent semantics for a data flow language

    • J. Dean Brock
    Pages 168-180

  14. Analog processes

    • Luca Cardelli
    Pages 181-193

  15. An extended polymorphic type system for applicative languages

    • Mario Coppo
    Pages 194-204

  16. A criterion of undecidability of algorithmic theories

    • Wiktor Dańko
    Pages 205-218

  17. On finding the optimal access path to resolve a relational data base query

    • P. Degano, A. Lomanto, F. Sirovich
    Pages 219-230

  18. Compound algebraic implementations: An approach to stepwise refinement of software systems

    • H. Ehrig, H. -J. Kreowski, B. Mahr, P. Padawitz
    Pages 231-245

  19. On and/or schemes

    • David Harel
    Pages 246-260

  20. A term model for CCS

    • M. C. B. Hennessy, G. D. Plotkin
    Pages 261-274
Back to top

Keywords

Bibliographic Information

  • Book Title: Mathematical Foundations of Computer Science 1980

  • Book Subtitle: 9th Symposium Held in Rydzyna, Poland, September 1-5, 1980. Proceedings

  • Editors: P. Dembiński

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/BFb0022491

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1980

  • Softcover ISBN: 978-3-540-10027-0Published: 01 August 1980

  • eBook ISBN: 978-3-540-38194-5Published: 23 November 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VIII, 726

  • Topics: Mathematical Logic and Formal Languages

Publish with us

Policies and ethics

Back to top

Search

Navigation