A proof system for type theory and CCS

  • O. Schelén
  • N. O. Forsgren
Part of the Lecture Notes in Computer Science book series (LNCS, volume 349)


  1. [Hennessy 86]
    M. Hennessy. Proving systolic systems correct. TOPLAS 8 (3), pp. 344–387, 1986.Google Scholar
  2. [Peterson 82]
    K. Peterson. A Programming system for type theory. PMG Memo 21, Chalmers University of Technology, S-412 96 Göteborg, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • O. Schelén
  • N. O. Forsgren

There are no affiliations available

Personalised recommendations