Skip to main content
SpringerLink
Log in

A proof system for type theory and CCS

  • Systems
  • Conference paper
  • First Online:
STACS 89 (STACS 1989)

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

Included in the following conference series:

  • 141 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. M. Hennessy. Proving systolic systems correct. TOPLAS 8 (3), pp. 344–387, 1986.

    Google Scholar 

  2. K. Peterson. A Programming system for type theory. PMG Memo 21, Chalmers University of Technology, S-412 96 Göteborg, 1982.

    Google Scholar 

Download references

Authors
  1. O. Schelén
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. O. Forsgren
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien R. Cori

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schelén, O., Forsgren, N.O. (1989). A proof system for type theory and CCS. In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029018

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50840-3

  • Online ISBN: 978-3-540-46098-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation