Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Related Work
Conclusion and Future Work
References
All Topics
Computer Science

Choreographies as Functions

Profile image of Luís Cruz-FilipeLuís Cruz-Filipe

2021, arXiv (Cornell University)

visibility

…

description

43 pages

link

1 file

Abstract

Choreographic programming is an emerging programming paradigm for concurrent and distributed systems, whereby developers write the communications that should be enacted and then a distributed implementation is automatically obtained by means of a compiler. Theories of choreographic programming typically come with strong theoretical guarantees about the compilation process, most notably: the generated implementations operationally correspond to their source choreographies and are deadlock-free. Currently, the most advanced incarnation of the paradigm is Choral, an object-oriented choreographic programming language that targets Java. Choral deviated significantly from known theories of choreographies, and in particular introduced the possibility of expressing higher-order choreographies (choreographies parameterised over choreographies) that are fully distributed. As a consequence, it is unclear whether the usual guarantees of choreographic programming can still hold in the more general setting of higher-order choreographies. In this article, we introduce Chorλ, the first functional choreographic programming language: it introduces a new formulation of the standard communication primitive found in choreographies as a function, and it is based upon the λ-calculus. Chorλ is the first theory that explains the core ideas of higher-order choreographic programming (as in Choral). Interestingly, bridging the gap between practice and theory requires developing a new evaluation strategy and typing discipline for λ terms that accounts for the distributed nature of computation in choreographies. We illustrate the expressivity of Chorλ with a series of examples, which include also reconstructions of the key examples found in the original presentation of Choral. Our theory supports all the expected properties of choreographic programming. By offering the first interpretation of choreographies as terms in λ-calculus, our work also serves to bridge the gap between the communities of functional and choreographic programming. 2012 ACM Subject Classification Theory of computation → Lambda calculus; Theory of computation → Distributed computing models; Computing methodologies → Distributed programming languages

Related papers

Reasoning about Choreographic Programs
Luís Cruz-Filipe

arXiv (Cornell University), 2023

Choreographic programming is a paradigm where a concurrent or distributed system is developed in a top-down fashion. Programs, called choreographies, detail the desired interactions between processes, and can be compiled to distributed implementations based on message passing. Choreographic languages usually guarantee deadlock-freedom and provide an operational correspondence between choreographies and their compiled implementations, but until now little work has been done on verifying other properties. This paper presents a Hoare-style logic for reasoning about the behaviour of choreographies, and illustrate its usage in representative examples. We show that this logic is sound and complete, and discuss decidability of its judgements. Using existing results from choreographic programming, we show that any functional correctness property proven for a choreography also holds for its compiled implementation.

View PDFchevron_right
Choreographies, Divided and Conquered
Luís Cruz-Filipe

arXiv (Cornell University), 2016

Choreographic Programming is a paradigm for developing concurrent software that is correct by construction, by syntactically disallowing mismatched I/O operations in programs, called choreographies. Due to their benefits, choreographies have been largely adopted for the writing of business processes and communication protocols. However, current choreography language models cannot capture many kinds of communication structures, limiting their applicability. In this paper, we present Procedural Choreographies (PC), a new language model that includes the novel feature of reusable choreographic procedures, parameterised on the processes they use. PC also combines, for the first time in choreographies, general recursion with the ability to create new processes at runtime. The combination of these features yields a powerful framework where we can write divide-and-conquer concurrent algorithms based on message passing. This enhanced expressivity makes it possible to write new behaviours that cannot be faithfully implemented (unrealisability); to tackle this issue, we endow PC with a new typing discipline that supports both decidable type checking and type inference. PC is equipped with an EndPoint Projection (EPP) that, from a well-typed choreography, synthesises a correct-byconstruction distributed implementation in a process calculus. Extending a previous line of work on choreographies, our model supports two important properties wrt the programming of concurrent algorithms: implicit parallelism and transparent projection.

View PDFchevron_right
FACILE: A symmetric integration of concurrent and functional programming
Alessandro Giacalone

Lecture Notes in Computer Science, 1989

FACILE is a language which symmetrically integrates concurrent and functional programming. It is a typed and statically scoped language. The language supports both function and process abstractions.

View PDFchevron_right
The Imperative and Functional Programming Paradigm
Rinus Plasmeijer, Henk Barendregt

Computability via Turing machines gave rise to Imperative Programming. Computability described via λ-calculus gave rise to Functional Programming. As imperative programs are more easy to run on hardware, this style of software became predominant. We present major advantages of the functional programming paradigm over the imperative one, that are applicable, provided one is has the mental capacity to explicitly deal with simple abstractions.

View PDFchevron_right
A Language for the Declarative Composition of Concurrent Protocols
Luís Cruz-Filipe

HAL (Le Centre pour la Communication Scientifique Directe), 2016

Choreographic Programming is an emerging paradigm for correct-by-construction concurrent programming. However, its applicability is limited by the current lack of support for reusable procedures. We propose Procedural Choreographies (PC), a choreographic language model with full procedural abstraction. PC includes unbounded process creation and name mobility, yielding a powerful framework for writing correct concurrent algorithms that can be compiled into a process calculus. This increased expressivity requires a typing discipline to ensure that processes are properly connected when enacting procedures.

View PDFchevron_right
A Theoretical Basis of Communication-Centred Concurrent Programming
Gary Brown

2000

We introduce two different ways of describing communication-centric software in the form of formal calculi and discuss their relationship. Two differ- ent paradigms of description, one centring on global message flows an d another centring on local (end-point) behaviours, share the common feature, structured representation of communications . The global calculus originates from Chore- ography Description Language (CDL), a web

View PDFchevron_right
Imperative functional programming
Uday Reddy

ACM Computing Surveys, 1996

View PDFchevron_right
Eden — The paradise of functional concurrent programming
Ricardo Peña

Lecture Notes in Computer Science, 1996

View PDFchevron_right
Task-oriented programming in a pure functional language
Peter Achten

Proceedings of the 14th symposium on Principles and practice of declarative programming - PPDP '12, 2012

Task-Oriented Programming (TOP) is a novel programming paradigm for the construction of distributed systems where users work together on the internet. When multiple users collaborate, they need to interact with each other frequently. TOP supports the definition of tasks that react to the progress made by others. With TOP, complex multiuser interactions can be programmed in a declarative style just by defining the tasks that have to be accomplished, thus eliminating the need to worry about the implementation detail that commonly frustrates the development of applications for this domain. TOP builds on four core concepts: tasks that represent computations or work to do which have an observable value that may change over time, data sharing enabling tasks to observe each other while the work is in progress, generic type driven generation of user interaction, and special combinators for sequential and parallel task composition. The semantics of these core concepts is defined in this paper. As an example we present the iTask3 framework, which embeds TOP in the functional programming language Clean.

View PDFchevron_right
Formalising a Turing-Complete Choreographic Language in Coq
Luís Cruz-Filipe

ArXiv, 2021

Theory of choreographic languages typically includes a number of complex results that are proved by structural induction. The high number of cases and the subtle details in some of them lead to long reviewing processes, and occasionally to errors being found in published proofs. In this work, we take a published proof of Turing completeness of a choreographic language and formalise it in Coq. Our development includes formalising the choreographic language and its basic properties, Kleene's theory of partial recursive functions, the encoding of these functions as choreographies, and proving this encoding correct. With this effort, we show that theorem proving can be a very useful tool in the field of choreographic languages: besides the added degree of confidence that we get from a mechanised proof, the formalisation process led us to a significant simplification of the underlying theory. Our results offer a foundation for the future formal development of choreographic languages.

View PDFchevron_right

References (46)

  1. Elvira Albert and Ivan Lanese, editors. Formal Techniques for Distributed Objects, Components, and Systems -36th IFIP WG 6.1 International Conference, FORTE 2016, Held as Part of the 11th International Federated Conference on Distributed Computing Techniques, DisCoTec 2016, Heraklion, Crete, Greece, June 6-9, 2016, Proceedings, volume 9688 of Lecture Notes in Computer Science. Springer, 2016.
  2. Davide Ancona, Viviana Bono, Mario Bravetti, Joana Campos, Giuseppe Castagna, Pierre- Malo Deniélou, Simon J. Gay, Nils Gesbert, Elena Giachino, Raymond Hu, Einar Broch Johnsen, Francisco Martins, Viviana Mascardi, Fabrizio Montesi, Rumyana Neykova, Nich- olas Ng, Luca Padovani, Vasco T. Vasconcelos, and Nobuko Yoshida. Behavioral types in programming languages. Foundations and Trends in Programming Languages, 3(2-3):95-230, 2016.
  3. Franco Barbanera, Ugo de'Liguoro, and Rolf Hennicker. Connecting open systems of communicating finite state machines. J. Log. Algebraic Methods Program., 109, 2019. doi:10.1016/j.jlamp.2019.07.004.
  4. Mario Bravetti and Gianluigi Zavattaro. Towards a unifying theory for choreography conform- ance and contract compliance. In Markus Lumpe and Wim Vanderperren, editors, Software Composition, 6th International Symposium, SC 2007, Braga, Portugal, March 24-25, 2007, Revised Selected Papers, volume 4829 of Lecture Notes in Computer Science, pages 34-50.
  5. Springer, 2007. doi:10.1007/978-3-540-77351-1\_4.
  6. Alessandro Bruni, Marco Carbone, Rosario Giustolisi, Sebastian Mödersheim, and Carsten Schürmann. Security protocols as choreographies. In Daniel Dougherty, José Meseguer, Sebastian Alexander Mödersheim, and Paul D. Rowe, editors, Protocols, Strands, and Logic -Essays Dedicated to Joshua Guttman on the Occasion of his 66.66th Birthday, volume 13066 of Lecture Notes in Computer Science, pages 98-111. Springer, 2021. doi:10.1007/ 978-3-030-91631-2\_5.
  7. Marco Carbone, Kohei Honda, and Nobuko Yoshida. Structured communication-centered programming for web services. ACM Trans. Program. Lang. Syst., 34(2):8:1-8:78, 2012. doi:10.1145/2220365.2220367.
  8. Marco Carbone and Fabrizio Montesi. Deadlock-freedom-by-design: multiparty asynchronous global programming. In Roberto Giacobazzi and Radhia Cousot, editors, Procs. POPL, pages 263-274. ACM, 2013. doi:10.1145/2429069.2429101.
  9. Luca Cardelli and Andrew D. Gordon. Mobile ambients. Theor. Comput. Sci., 240(1):177-213, 2000. doi:10.1016/S0304-3975(99)00231-5.
  10. 9 Giuseppe Castagna, Mariangiola Dezani-Ciancaglini, and Luca Padovani. On global types and multi-party sessions. In Formal Techniques for Distributed Systems, pages 1-28. Springer, 2011.
  11. David Castro-Perez and Nobuko Yoshida. Compiling first-order functions to session-typed parallel code. In Louis-Noël Pouchet and Alexandra Jimborean, editors, CC '20: 29th International Conference on Compiler Construction, San Diego, CA, USA, February 22-23, 2020, pages 143-154. ACM, 2020. doi:10.1145/3377555.3377889.
  12. Alonzo Church. A set of postulates for the foundation of logic. Annals of Mathematics, 33(2):346-366, 1932. URL: http://www.jstor.org/stable/1968337.
  13. Luís Cruz-Filipe and Fabrizio Montesi. Choreographies in practice. In Albert and Lanese [1], pages 114-123. doi:10.1007/978-3-319-39570-8_8.
  14. Luís Cruz-Filipe and Fabrizio Montesi. Procedural choreographic programming. In FORTE, volume 10321 of Lecture Notes in Computer Science, pages 92-107. Springer, 2017.
  15. Luís Cruz-Filipe and Fabrizio Montesi. A core model for choreographic programming. Theor. Comput. Sci., 802:38-66, 2020. doi:10.1016/j.tcs.2019.07.005.
  16. Luís Cruz-Filipe, Fabrizio Montesi, and Marco Peressotti. Communications in choreographies, revisited. In Proceedings of the 33rd Annual ACM Symposium on Applied Computing, SAC 2018, Pau, France, April 09-13, 2018, pages 1248-1255. ACM, 2018. doi:10.1145/3167132.3167267.
  17. Luís Cruz-Filipe, Fabrizio Montesi, and Marco Peressotti. Certifying choreography compilation. In Antonio Cerone and Peter Csaba Ölveczky, editors, Theoretical Aspects of Computing -ICTAC 2021 -18th International Colloquium, Virtual Event, Nur-Sultan, Kazakhstan, September 8-10, 2021, Proceedings, volume 12819 of Lecture Notes in Computer Science, pages 115-133. Springer, 2021. doi:10.1007/978-3-030-85315-0\_8.
  18. Luís Cruz-Filipe, Fabrizio Montesi, and Marco Peressotti. Formalising a turing-complete choreographic language in coq. In Liron Cohen and Cezary Kaliszyk, editors, 12th International Conference on Interactive Theorem Proving, ITP 2021, June 29 to July 1, 2021, Rome, Italy (Virtual Conference), volume 193 of LIPIcs, pages 15:1-15:18. Schloss Dagstuhl -Leibniz- Zentrum für Informatik, 2021. doi:10.4230/LIPIcs.ITP.2021.15.
  19. Mila Dalla Preda, Maurizio Gabbrielli, Saverio Giallorenzo, Ivan Lanese, and Jacopo Mauro. Dynamic choreographies: Theory and implementation. Log. Methods Comput. Sci., 13(2), 2017. doi:10.23638/LMCS-13(2:1)2017.
  20. Romain Demangeon and Kohei Honda. Nested protocols in session types. In Maciej Koutny and Irek Ulidowski, editors, CONCUR 2012 -Concurrency Theory -23rd International Conference, CONCUR 2012, Newcastle upon Tyne, UK, September 4-7, 2012. Proceedings, volume 7454 of Lecture Notes in Computer Science, pages 272-286. Springer, 2012. doi: 10.1007/978-3-642-32940-1\_20.
  21. Whitfield Diffie and Martin E. Hellman. New directions in cryptography. IEEE Trans. Inf. Theory, 22(6):644-654, 1976. doi:10.1109/TIT.1976.1055638.
  22. Saverio Giallorenzo, Ivan Lanese, and Daniel Russo. Chip: A choreographic integration process. In Hervé Panetto, Christophe Debruyne, Henderik A. Proper, Claudio Agostino Ardagna, Dumitru Roman, and Robert Meersman, editors, Procs. OTM, part II, volume 11230 of Lecture Notes in Computer Science, pages 22-40. Springer, 2018. doi:10.1007/978-3-030-02671-4_2.
  23. Saverio Giallorenzo, Fabrizio Montesi, and Marco Peressotti. Choreographies as objects. CoRR, abs/2005.09520, 2020. URL: https://arxiv.org/abs/2005.09520.
  24. Saverio Giallorenzo, Fabrizio Montesi, Marco Peressotti, David Richter, Guido Salvaneschi, and Pascal Weisenburger. Multiparty Languages: The Choreographic and Multitier Cases. In 35th European Conference on Object-Oriented Programming, ECOOP 2021, July 12-17, 2021, Aarhus, Denmark (Virtual Conference), LIPIcs. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2021. To appear. Pre-print available at https://fabriziomontesi.com/files/ gmprsw21.pdf.
  25. Matthew Hennessy. A distributed Pi-calculus. Cambridge University Press, 2007.
  26. Andrew K. Hirsch and Deepak Garg. Pirouette: higher-order typed functional choreographies. Proc. ACM Program. Lang., 6(POPL):1-27, 2022. doi:10.1145/3498684.
  27. Kohei Honda, Aybek Mukhamedov, Gary Brown, Tzu-Chun Chen, and Nobuko Yoshida. Scribbling interactions with a formal foundation. In Raja Natarajan and Adegboyega K. Ojo, editors, Distributed Computing and Internet Technology -7th International Conference, ICDCIT 2011, Bhubaneshwar, India, February 9-12, 2011. Proceedings, volume 6536 of Lecture Notes in Computer Science, pages 55-75. Springer, 2011. doi:10.1007/978-3-642-19056-8\ _4.
  28. Kohei Honda, Nobuko Yoshida, and Marco Carbone. Multiparty asynchronous session types. J. ACM, 63(1):9, 2016. Also: POPL, pages 273-284, 2008. doi:10.1145/2827695.
  29. Hans Hüttel, Ivan Lanese, Vasco T. Vasconcelos, Luís Caires, Marco Carbone, Pierre-Malo Deniélou, Dimitris Mostrous, Luca Padovani, António Ravara, Emilio Tuosto, Hugo Torres Vieira, and Gianluigi Zavattaro. Foundations of session types and behavioural contracts. ACM Comput. Surv., 49(1):3:1-3:36, 2016. doi:10.1145/2873052.
  30. Intl. Telecommunication Union. Recommendation Z.120: Message Sequence Chart, 1996.
  31. Sung-Shik Jongmans and Petra van den Bos. A predicate transformer for choreographies- computing preconditions in choreographic programming. In Peter Müller, editor, Programming Languages and Systems -31st European Symposium on Programming, ESOP 2022, Proceedings, volume To appear of Lecture Notes in Computer Science. Springer, 2022.
  32. Tanakorn Leesatapornwongsa, Jeffrey F. Lukman, Shan Lu, and Haryadi S. Gunawi. TaxDC: A taxonomy of non-deterministic concurrency bugs in datacenter distributed systems. In Proc. of ASPLOS, pages 517-530, 2016.
  33. Alberto Lluch-Lafuente, Flemming Nielson, and Hanne Riis Nielson. Discretionary in- formation flow control for interaction-oriented specifications. In Narciso Martí-Oliet, Peter Csaba Ölveczky, and Carolyn L. Talcott, editors, Logic, Rewriting, and Concur- rency, volume 9200 of Lecture Notes in Computer Science, pages 427-450. Springer, 2015. doi:10.1007/978-3-319-23165-5_20.
  34. Hugo A. López and Kai Heussen. Choreographing cyber-physical distributed control systems for the energy sector. In Ahmed Seffah, Birgit Penzenstadler, Carina Alves, and Xin Peng, editors, Procs. SAC, pages 437-443. ACM, 2017. doi:10.1145/3019612.3019656.
  35. Hugo A. López, Flemming Nielson, and Hanne Riis Nielson. Enforcing availability in failure- aware communicating systems. In Albert and Lanese [1], pages 195-211. doi:10.1007/ 978-3-319-39570-8_13.
  36. Shan Lu, Soyeon Park, Eunsoo Seo, and Yuanyuan Zhou. Learning from mistakes: a com- prehensive study on real world concurrency bug characteristics. In Proc. of ASPLOS, pages 329-339, 2008.
  37. Fabrizio Montesi. Choreographic Programming. Ph.D. Thesis, IT University of Copenhagen, 2013.
  38. Fabrizio Montesi. Introduction to Choreographies. Cambridge University Press, 2022. To appear.
  39. Fabrizio Montesi and Nobuko Yoshida. Compositional choreographies. In Pedro R. D'Argenio and Hernán C. Melgratti, editors, CONCUR 2013 -Concurrency Theory -24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings, volume 8052 of Lecture Notes in Computer Science, pages 425-439. Springer, 2013. doi: 10.1007/978-3-642-40184-8\_30.
  40. Tom Murphy VII, Karl Crary, Robert Harper, and Frank Pfenning. A symmetric modal lambda calculus for distributed computing. In 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 14-17 July 2004, Turku, Finland, Proceedings, pages 286-295. IEEE Computer Society, 2004. doi:10.1109/LICS.2004.1319623.
  41. Roger M. Needham and Michael D. Schroeder. Using encryption for authentication in large networks of computers. Commun. ACM, 21(12):993-999, 1978. doi:10.1145/359657.359659. 41 Object Management Group. Business Process Model and Notation. http://www.omg.org/spec/BPMN/2.0/, 2011.
  42. Peter W. O'Hearn. Experience developing and deploying concurrency analysis at facebook. In Andreas Podelski, editor, Static Analysis -25th International Symposium, SAS 2018, Freiburg, Germany, August 29-31, 2018, Proceedings, volume 11002 of Lecture Notes in Computer Science, pages 56-70. Springer, 2018. doi:10.1007/978-3-319-99725-4\_5.
  43. OpenID Foundation. OpenID Specification. https://openid.net/developers/specs/, 2014.
  44. Johannes Åman Pohjola, Alejandro Gómez-Londoño, James Shaker, and Michael Norrish. Kalas: A verified, end-to-end compiler for a choreographic language. In June Andronick and Leonardo de Moura, editors, 13th International Conference on Interactive Theorem Proving, ITP 2022, August 7-10, 2022, Haifa, Israel, volume 237 of LIPIcs, pages 27:1-27:18. Schloss Dagstuhl -Leibniz-Zentrum für Informatik, 2022. doi:10.4230/LIPIcs.ITP.2022.27.
  45. Zongyan Qiu, Xiangpeng Zhao, Chao Cai, and Hongli Yang. Towards the theoretical foundation of choreography. In WWW, pages 973-982, United States, 2007. IEEE Computer Society Press.
  46. John Vollbrecht, James D. Carlson, Larry Blunk, Dr. Bernard D. Aboba, and Henrik Levkowetz. Extensible Authentication Protocol (EAP). RFC 3748, June 2004. URL: https://rfc-editor. org/rfc/rfc3748.txt, doi:10.17487/RFC3748.

Related papers

Functional Choreographic Programming
Luís Cruz-Filipe

Springer eBooks, 2022

Choreographic programming is an emerging programming paradigm for concurrent and distributed systems, whereby developers write the communications that should be enacted and then a distributed implementation is automatically obtained by means of a compiler. Theories of choreographic programming typically come with strong theoretical guarantees about the compilation process, most notably: the generated implementations operationally correspond to their source choreographies and are deadlock-free. Currently, the most advanced incarnation of the paradigm is Choral, an object-oriented choreographic programming language that targets Java. Choral deviated significantly from known theories of choreographies, and in particular introduced the possibility of expressing higher-order choreographies (choreographies parameterised over choreographies) that are fully distributed. As a consequence, it is unclear whether the usual guarantees of choreographic programming can still hold in the more general setting of higher-order choreographies. In this article, we introduce Chorλ, the first functional choreographic programming language: it introduces a new formulation of the standard communication primitive found in choreographies as a function, and it is based upon the λ-calculus. Chorλ is the first theory that explains the core ideas of higher-order choreographic programming (as in Choral). Interestingly, bridging the gap between practice and theory requires developing a new evaluation strategy and typing discipline for λ terms that accounts for the distributed nature of computation in choreographies. We illustrate the expressivity of Chorλ with a series of examples, which include also reconstructions of the key examples found in the original presentation of Choral. Our theory supports all the expected properties of choreographic programming. By offering the first interpretation of choreographies as terms in λ-calculus, our work also serves to bridge the gap between the communities of functional and choreographic programming.

View PDFchevron_right
Choreographic Programming
Fabrizio Montesi

Choreographies are descriptions of distributed systems where the developer gives a global view of how messages are exchanged by endpoint nodes (endpoints for short), instead of separately defining the behaviour of each endpoint. They have a significant impact on the quality of software, as they offer a concise view of the message flows enacted by a system. For this reason, in the last decade choreographies have been employed in the development of programming languages, giving rise to a programming paradigm that in this dissertation we refer to as Choreographic Programming.

View PDFchevron_right
A Formal Theory of Choreographic Programming
Luís Cruz-Filipe

arXiv (Cornell University), 2022

Choreographic programming is a paradigm for writing coordination plans for distributed systems from a global point of view, from which correctby-construction decentralised implementations can be generated automatically. Theory of choreographies typically includes a number of complex results that are proved by structural induction. The high number of cases and the subtle details in some of these proofs has led to important errors being found in published works. In this work, we formalise the theory of a choreographic programming language in Coq. Our development includes the basic properties of this language, a proof of its Turing completeness, a compilation procedure to a process language, and an operational characterisation of the correctness of this procedure. Our formalisation experience illustrates the benefits of using a theorem prover: we get both an additional degree of confidence from the mechanised proof, and a significant simplification of the underlying theory. Our results offer a foundation for the future formal development of choreographic languages.

View PDFchevron_right
Procedural Choreographic Programming
Luís Cruz-Filipe

Lecture Notes in Computer Science, 2017

Choreographic Programming is an emerging paradigm for correct-by-construction concurrent programming. However, its applicability is limited by the current lack of support for reusable procedures. We propose Procedural Choreographies (PC), a choreographic language model with full procedural abstraction. PC includes unbounded process creation and name mobility, yielding a powerful framework for writing correct concurrent algorithms that can be compiled into a process calculus. This increased expressivity requires a typing discipline to ensure that processes are properly connected when enacting procedures.

View PDFchevron_right
On Asynchrony and Choreographies
Luís Cruz-Filipe

Electronic Proceedings in Theoretical Computer Science, 2017

Choreographic Programming is a paradigm for the development of concurrent software, where deadlocks are prevented syntactically. However, choreography languages are typically synchronous, whereas many real-world systems have asynchronous communications. Previous attempts at enriching choreographies with asynchrony rely on ad-hoc constructions, whose adequacy is only argued informally. In this work, we formalise the properties that an asynchronous semantics for choreographies should have: messages can be sent without the intended receiver being ready, and all sent messages are eventually received. We explore how out-of-order execution, used in choreographies for modelling concurrency, can be exploited to endow choreographies with an asynchronous semantics. Our approach satisfies the properties we identified. We show how our development yields a pleasant correspondence with FIFO-based asynchronous messaging, modelled in a process calculus, and discuss how it can be adopted in more complex choreography models.

View PDFchevron_right

Related topics

  • Computer Science
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved