Article

Sequentiality and the π-calculus

Authors:

Nobuko YoshidaAuthors Info & Claims

TLCA'01: Proceedings of the 5th international conference on Typed lambda calculi and applications

Pages 29 - 45

Published: 02 May 2001 Publication History

Abstract

We present a type discipline for the π-calculus which precisely captures the notion of sequential functional computation as a specific class of name passing interactive behaviour. The typed calculus allows direct interpretation of both call-by-name and call-by-value sequential functions. The precision of the representation is demonstrated by way of a fully abstract encoding of PCF. The result shows how a typed π-calculus can be used as a descriptive tool for a significant class of programming languages without losing the latter's semantic properties. Close correspondence with games semantics and process-theoretic reasoning techniques are together used to establish full abstraction.

References

[1]

Abramsky, S., Computational interpretation of linear logic. TCS, Vol. 111, 1993.

Digital Library

[2]

Abramsky, S., Honda, K. and McCusker, G., A Fully Abstract Game Semantics for General References. LICS, 334-344, IEEE, 1998.

Digital Library

[3]

Abramsky, S., Jagadeesan, R. and Malacaria, P., Full Abstraction for PCF. Info. & Comp., Vol. 163, 2000.

Digital Library

[4]

Berger, M. Honda, K. and N. Yoshida. Sequentiality and the π-Calculus. To appear as a QMW DCS Technical Report, 2001.

[5]

Berger, M. Honda, K. and N. Yoshida. Genericity in the π-Calculus. To appear as a QMW DCS Technical Report, 2001.

[6]

Berry, G. and Curien, P. L., Sequential algorithms on concrete data structures TCS, 20(3), 265-321, North-Holland, 1982.

[7]

Boreale, M. and Sangiorgi, D., Some congruence properties for π-calculus bisimilarities, TCS, 198, 159-176, 1998.

Digital Library

[8]

Boudol, G., Asynchrony and the pi-calculus, INRIA Research Report 1702, 1992.

[9]

Boudol, G., The pi-calculus in direct style, POPL'97, 228-241, ACM, 1997.

Digital Library

[10]

Curien, P. L., Sequentiality and full abstraction. Proc. of Application of Categories in Computer Science, LNM 177, 86-94, Cambridge Press, 1995.

[11]

Fiore, M. and Honda, K., Recursive Types in Games: axiomatics and process representation, LICS'98, 345-356, IEEE, 1998.

Digital Library

[12]

Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP'99, LNCS 1576, 74-90, Springer, 1999.

Digital Library

[13]

Girard, J.-Y., Linear Logic, TCS, Vol. 50, 1-102, 1987.

Digital Library

[14]

Gunter, C., Semantics of Programming Languages: Structures and Techniques, MIT Press, 1992.

Digital Library

[15]

Honda, K., Types for Dyadic Interaction. CONCUR'93, LNCS 715:, 509-523, 1993.

Digital Library

[16]

Honda, K., Composing Processes, POPL'96, 344-357, ACM, 1996.

Digital Library

[17]

Honda, K., Kubo, M. and Vasconcelos, V., Language Primitives and Type Discipline for Structured Communication-Based Programming. ESOP'98, LNCS 1381, 122-138. Springer-Verlag, 1998.

Digital Library

[18]

Honda, K. and Tokoro, M., An Object Calculus for Asynchronous Communication. ECOOP'91, LNCS 512, 133-147, Springer-Verlag 1991.

Digital Library

[19]

Honda, K. Vasconcelos, V., and Yoshida, N. Secure Information Flow as Typed Process Behaviour, ESOP '99, LNCS 1782, 180-199, Springer-Verlag, 2000.

Digital Library

[20]

Honda, K. and Yoshida, N. Game-theoretic analysis of call-by-value computation. TCS Vol. 221 (1999), 393-456, North-Holland, 1999.

Digital Library

[21]

Kobayashi, N., A partially deadlock-free typed process calculus, ACM TOPLAS, Vol. 20, No. 2, 436-482, 1998.

Digital Library

[22]

Kobayashi, N., Pierce, B., and Turner, D., Linear Types and π-calculus, POPL'96, 358-371, ACM Press, 1996.

Digital Library

[23]

Hyland, M. and Ong, L., On Full Abstraction for PCF: I, II and III. 130 pages, 1994. To appear in Info. & Comp.

Digital Library

[24]

Hyland, M. and Ong, L., Pi-calculus, dialogue games and PCF, FPCA'95, ACM, 1995.

Digital Library

[25]

Laird, J., Full abstraction for functional languages with control, LICS'97, IEEE, 1997.

Digital Library

[26]

McCusker, G., Games and Full Abstraction for FPC. LICS'96, IEEE, 1996.

Digital Library

[27]

Milner, R., Fully abstract models of typed lambda calculi. TCS, 4:1-22, 1977.

[28]

Milner, R., Functions as Processes. MSCS, 2(2), 119-146, CUP, 1992.

[29]

Milner, R., Polyadic π-Calculus: a tutorial. Proceedings of the International Summer School on Logic Algebra of Specification, Marktoberdorf, 1992.

[30]

Pierce, B.C. and Sangiorgi. D, Typing and subtyping for mobile processes. LICS'93, 187-215, IEEE, 1993.

[31]

Quaglia, P. and Walker, D., On Synchronous and Asynchronous Mobile Processes, FoSSaCS 00, LNCS 1784, 283-296, Springer, 2000.

Digital Library

[32]

Sangiorgi, D., Expressing Mobility in Process Algebras: First Order and Higher Order Paradigms. Ph.D. Thesis, University of Edinburgh, 1992.

[33]

Sangiorgi, D. π-calculus, internal mobility, and agent-passing calculi. TCS, 167(2):235-271, North-Holland, 1996.

Digital Library

[34]

Sangiorgi, D., The name discipline of uniform receptiveness, ICALP'97, LNCS 1256, 303-313, Springer, 1997.

Digital Library

[35]

Vasconcelos, V., Typed concurrent objects. ECOOP'94, LNCS 821, 100-117. Springer, 1994.

Digital Library

[36]

Vasconcelos, V. and Honda, K., Principal Typing Scheme for Polyadic π-Calculus. CONCUR'93, LNCS 715, 524-538, Springer-Verlag, 1993.

Digital Library

[37]

Yoshida, N., Graph Types for Monadic Mobile Processes, FST/TCS'16, LNCS 1180, 371-387, Springer-Verlag, December, 1996.

Digital Library

[38]

Yoshida, N., Berger, M. and Honda, K., Strong Normalisation in the π-Calculus, To appear as a MCS Technical Report, University of Leicester, 2001.

Cited By

Dixon ALazić RMurawski AWalukiewicz IGorla D(2021)Verifying higher-order concurrency with data automataProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470691(1-13)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470691
Liao KHammer MMiller AMcKinley KFisher K(2019)ILC: a calculus for composable, computational cryptographyProceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3314221.3314607(640-654)Online publication date: 8-Jun-2019
https://dl.acm.org/doi/10.1145/3314221.3314607
Castellan SYoshida N(2019)Two sides of the same coin: session types and game semantics: a synchronous side and an asynchronous sideProceedings of the ACM on Programming Languages10.1145/32903403:POPL(1-29)Online publication date: 2-Jan-2019
https://dl.acm.org/doi/10.1145/3290340
Show More Cited By

Sequentiality and the π-calculus
1. Theory of computation
  1. Semantics and reasoning

Recommendations

Semantic subtyping for the pi-calculus

Subtyping relations for the @p-calculus are usually defined in a syntactic way, by means of structural rules. We propose a semantic characterisation of channel types and use it to derive a subtyping relation. The type system we consider includes read-...
Genericity and the π-calculus

Types in processes delineate specific classes of interactive behaviour in a compositional way. Key elements of process theory, in particular behavioural equivalences, are deeply affected by types, leading to applications in the description and analysis ...
Proof systems for π-calculus logics
Logic for concurrency and synchronisation

We study the problem of verifying general temporal and functional properties of mobile and dynamic process networks, cast in terms of the π-calculus. Much of the expressive power of this calculus derives from the combination of name generation and ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

TLCA'01: Proceedings of the 5th international conference on Typed lambda calculi and applications

May 2001

429 pages

ISBN:3540419608

Editor:
Samson Abramsky
Oxford University Computing Laboratory, Oxford

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 02 May 2001

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

36
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Dixon ALazić RMurawski AWalukiewicz IGorla D(2021)Verifying higher-order concurrency with data automataProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470691(1-13)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470691
Liao KHammer MMiller AMcKinley KFisher K(2019)ILC: a calculus for composable, computational cryptographyProceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3314221.3314607(640-654)Online publication date: 8-Jun-2019
https://dl.acm.org/doi/10.1145/3314221.3314607
Castellan SYoshida N(2019)Two sides of the same coin: session types and game semantics: a synchronous side and an asynchronous sideProceedings of the ACM on Programming Languages10.1145/32903403:POPL(1-29)Online publication date: 2-Jan-2019
https://dl.acm.org/doi/10.1145/3290340
Durier AHirschkoff DSangiorgi D(2018)Eager Functions as ProcessesProceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3209108.3209152(364-373)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.1145/3209108.3209152
Biernacka MBiernacki DLenglet SPolesiuk PPous DSchmitt AAceto LIngólfsdóttir A(2017)Fully abstract encodings of λ-calculus in hocore through abstract machinesProceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3329995.3330053(1-12)Online publication date: 20-Jun-2017
https://dl.acm.org/doi/10.5555/3329995.3330053
Kouzapas DPérez JYoshida N(2017)Characteristic bisimulation for higher-order session processesActa Informatica10.1007/s00236-016-0289-754:3(271-341)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1007/s00236-016-0289-7
Sakayori KTsukada T(2017)A Truly Concurrent Game Model of the Asynchronous $$\pi $$-CalculusProceedings of the 20th International Conference on Foundations of Software Science and Computation Structures - Volume 1020310.1007/978-3-662-54458-7_23(389-406)Online publication date: 22-Apr-2017
https://dl.acm.org/doi/10.1007/978-3-662-54458-7_23
Orchard DYoshida N(2016)Effects as sessions, sessions as effectsACM SIGPLAN Notices10.1145/2914770.283763451:1(568-581)Online publication date: 11-Jan-2016
https://dl.acm.org/doi/10.1145/2914770.2837634
Orchard DYoshida NBodik RMajumdar R(2016)Effects as sessions, sessions as effectsProceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages10.1145/2837614.2837634(568-581)Online publication date: 11-Jan-2016
https://dl.acm.org/doi/10.1145/2837614.2837634
Kouzapas DPérez JYoshida N(2016)On the Relative Expressiveness of Higher-Order Session ProcessesProceedings of the 25th European Symposium on Programming Languages and Systems - Volume 963210.1007/978-3-662-49498-1_18(446-475)Online publication date: 2-Apr-2016
https://dl.acm.org/doi/10.1007/978-3-662-49498-1_18
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten