Skip to main content
SpringerLink
Log in

A proof theoretical approach to communication

  • Session 6: Calculi for Concurrency I
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1997)

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

Included in the following conference series:

Abstract

The paper investigates a concurrent computation model, chi calculus, in which communications resemble cut eliminations for classical proofs. The algebraic properties of the model are studied. Its relationship to sequential computation is illustrated by showing that it incorporates the operational semantics of the call-by-name lambda calculus. Practically the model has pi calculus as a submodel.

Supported by NNSF of China, grant number 69503006.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S.: Proofs as Processes. Theoretical Computer Science 135 (1994) 5–9

    Article  Google Scholar 

  2. Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. 1984

    Google Scholar 

  3. Bellin, G., Scott, P.: Remarks on the π-Calculus and Linear Logic. Theoretical Computer Science 135 (1994) 11–65

    Article  Google Scholar 

  4. Girard, J.: Linear Logic. Theoretical Computer Science 50 (1987) 1–102

    Article  Google Scholar 

  5. Milner, R.: Functions as Processes. Journal of Mathematical Structures in Computer Science 2 (1992) 119–141

    Google Scholar 

  6. Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes. Information and Computation 100 (1992) 1–40 (Part I), 41–77 (Part II)

    Article  Google Scholar 

  7. Plotkin, G.: Call-by-Name, Call-by-Value and the λ-Calculus. Theoretical Computer Science 1 (1975) 125–159

    Article  Google Scholar 

  8. Sangiorgi, D.: A Theory of Bisimulation for π-Calculus. Proc. CONCUR 93, LNCS 715 (1993) 127–142

    Google Scholar 

  9. Thomsen, B.: Plain CHOCS — A Second Generation Calculus for Higher Order Processes. Acta Informatica 30 (1993) 1–59

    Article  Google Scholar 

  10. Walker, D.: Objects in the π-Calculus. Information and Computation 116 (1995) 253–271

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Shanghai Jiao Tong University, 1954 Hua Shan Road, 200030, Shanghai, China

    Yuxi Fu

Authors
  1. Yuxi Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierpaolo Degano Roberto Gorrieri Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fu, Y. (1997). A proof theoretical approach to communication. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_189

Download citation

  • DOI: https://doi.org/10.1007/3-540-63165-8_189

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63165-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation