Choreographic programming: Difference between revisions

Revision as of 08:35, 9 June 2023

Revision as of 15:28, 26 June 2023

Line 2:

{{Programming paradigms}}

In [[computer science]], '''choreographic programming''' is a [[programming paradigm]] where programs are compositions of interactions among multiple [[concurrent computing|concurrent]] participants.<ref name="itc">{{cite book |last1=Montesi |first1=Fabrizio |title=Introduction to Choreographies |date=2023 |publisher=Cambridge University Press |isbn=978-1-108-83376-9 |url=https://doi.org/10.1017/9781108981491}}</ref><ref name="bt-survey">{{Cite journal|url=https://doi.org/10.1561/2500000031|doi = 10.1561/2500000031|title = Behavioral Types in Programming Languages|year = 2016|last1 = Yoshida|first1 = Nobuko|last2 = Vasconcelos|first2 = Vasco T.|last3 = Padovani|first3 = Luca|last4 = Bono|first4 = Nicholas Ng|last5 = Neykova|first5 = Rumyana|last6 = Montesi|first6 = Fabrizio|last7 = Mascardi|first7 = Viviana|last8 = Martins|first8 = Francisco|last9 = Johnsen|first9 = Einar Broch|last10 = Hu|first10 = Raymond|last11 = Giachino|first11 = Elena|last12 = Gesbert|first12 = Nils|last13 = Gay|first13 = Simon J.|last14 = Deniélou|first14 = Pierre-Malo|last15 = Castagna|first15 = Giuseppe|last16 = Campos|first16 = Joana|last17 = Bravetti|first17 = Mario|last18 = Bono|first18 = Viviana|last19 = Ancona|first19 = Davide|journal = Foundations and Trends in Programming Languages|volume = 3|issue = 2–3|pages = 95–230| hdl=10044/1/44282 }}</ref><ref name="mp-langs">{{Cite book|url=https://doi.org/10.4230/LIPIcs.ECOOP.2021.22|doi = 10.4230/LIPIcs.ECOOP.2021.22|year = 2021|last1 = Giallorenzo|first1 = Saverio|last2 = Montesi|first2 = Fabrizio|last3 = Peressotti|first3 = Marco|last4 = Richter|first4 = David|last5 = Salvaneschi|first5 = Guido|last6 = Weisenburger|first6 = Pascal|title = Multiparty Languages: The Choreographic and Multitier Cases (Pearl)|series = Leibniz International Proceedings in Informatics (LIPIcs)|volume = 194|pages = 22:1–22:27|isbn = 9783959771900}} [https://2021.ecoop.org/details/ecoop-2021-ecoop-research-papers/9/Multiparty-Languages-the-Choreographic-and-Multitier-Cases (ECOOP 2021 Distinguished Paper)]</ref>

== Overview ==

=== Choreographies ===

In choreographic programming, developers use a '''choreographic programming language''' to define the intended communication behaviour of concurrent participants. Programs in this paradigm are called '''choreographies'''.<ref name="bt-surveyitc"/>

Choreographic languages are inspired by [[security protocol notation]] (also known as "Alice and Bob" notation). The key to these languages is the communication primitive, for example

<syntaxhighlight lang="text">

Line 38:

=== Endpoint Projection ===

A key feature of choreographic programming is the capability of compiling choreographies to distributed implementations. These implementations can be libraries for software that needs to participate in a computer network by following a protocol,<ref name="itc"/><ref name="mp-langs" /><ref>[https://www.choral-lang.org/ Choral programming language]</ref> or standalone distributed programs.<ref name=":0" /><ref name="aiocj-paper" />

The translation of a choreography into distributed programs is called '''endpoint projection''' (EPP for short).<ref name="bt-survey" /><ref name="mp-langs" />

Line 71:

== Development ==

The paradigm of choreographic programming originates from its titular PhD thesis.<ref name="M13:phd">{{cite thesis |type=PhD |last=Montesi |first=Fabrizio |date=2013 |title=Choreographic Programming |url=https://www.fabriziomontesi.com/files/choreographic_programming.pdf |___location= |publisher=IT University of Copenhagen |isbn=978-87-7949-299-8}} [https://eapls.org/items/1855/ (EAPLS Best PhD Dissertation Award)]</ref><ref name="GH21">{{cite journal |last1=Hirsch |first1=Andrew K. |last2=Garg |first2=Deepak |title=Pirouette: higher-order typed functional choreographies |journal=Proceedings of the ACM on Programming Languages |date=16 January 2022 |volume=6 |issue=POPL |pages=1–27 |doi=10.1145/3498684|s2cid=243833095 }} [https://popl22.sigplan.org/details/POPL-2022-popl-research-papers/23/Pirouette-Higher-Order-Typed-Functional-Choreographies (POPL 2022 Distinguished Paper)]</ref><ref>{{cite web |url=https://eapls.org/items/1855/ |title=Fabrizio Montesi wins the EAPLS Best PhD Dissertation Award 2014 |author=Arend Rensink |date=2015-08-30 |publisher=European Association for Programming Languages and Systems}}</ref>

The inspiration for the syntax of choreographic programming languages can be traced back to [[security protocol notation]], also known as "Alice and Bob" notation.<ref name="itc"/> Choreographic programming has also been heavily influenced by standards for [[service choreography]] and [[sequence diagram|interaction diagrams]], as well as developments of the theory of [[process calculus|process calculi]].<ref name="itc"/><ref name="mp-langs"/><ref>{{Cite journal|url=https://doi.org/10.1145/2220365.2220367|doi=10.1145/2220365.2220367|title=Structured Communication-Centered Programming for Web Services|year=2012|last1=Carbone|first1=Marco|last2=Honda|first2=Kohei|last3=Yoshida|first3=Nobuko|journal=ACM Transactions on Programming Languages and Systems|volume=34|issue=2|pages=1–78|s2cid=15737118}}</ref>

Choreographic programming is an active area of research. The paradigm has been used in the study of [[Information flow (information theory)|information flow]],<ref>{{Cite book|chapter-url=https://doi.org/10.1007/978-3-319-23165-5_20|doi = 10.1007/978-3-319-23165-5_20|chapter = Discretionary Information Flow Control for Interaction-Oriented Specifications|title = Logic, Rewriting, and Concurrency|series = Lecture Notes in Computer Science|year = 2015|last1 = Lluch Lafuente|first1 = Alberto|last2 = Nielson|first2 = Flemming|last3 = Nielson|first3 = Hanne Riis|volume = 9200|pages = 427–450|isbn = 978-3-319-23164-8| s2cid=32617923 |url = https://backend.orbit.dtu.dk/ws/files/119987994/Discretionary_Information_Flow_Control_for_Interaction_Oriented_Specifications.pdf}}</ref> [[parallel computing]],<ref>{{Cite book|chapter-url=https://doi.org/10.1007/978-3-319-39570-8_8|doi = 10.1007/978-3-319-39570-8_8|chapter = Choreographies in Practice|title = Formal Techniques for Distributed Objects, Components, and Systems|series = Lecture Notes in Computer Science|year = 2016|last1 = Cruz-Filipe|first1 = Luís|last2 = Montesi|first2 = Fabrizio|volume = 9688|pages = 114–123|arxiv = 1602.08863|isbn = 978-3-319-39569-2|s2cid = 18067252}}</ref> [[cyber-physical system]]s,<ref>{{Cite book|chapter-url=https://doi.org/10.1145/3019612.3019656|doi=10.1145/3019612.3019656|chapter=Choreographing cyber-physical distributed control systems for the energy sector|title=Proceedings of the Symposium on Applied Computing|year=2017|last1=López|first1=Hugo A.|last2=Heussen|first2=Kai|pages=437–443|isbn=9781450344869|s2cid=39112346}}</ref><ref>{{Cite book|chapter-url=https://backend.orbit.dtu.dk/ws/files/123934557/main.pdf|doi = 10.1007/978-3-319-39570-8_13|chapter = Enforcing Availability in Failure-Aware Communicating Systems|title = Formal Techniques for Distributed Objects, Components, and Systems|series = Lecture Notes in Computer Science|year = 2016|last1 = López|first1 = Hugo A.|last2 = Nielson|first2 = Flemming|last3 = Nielson|first3 = Hanne Riis|volume = 9688|pages = 195–211|isbn = 978-3-319-39569-2| s2cid=12872876 }}</ref> [[adaptability|runtime adaptation]],<ref name="aiocj-paper">{{Cite journal|url=https://doi.org/10.23638/LMCS-13(2:1)2017|doi = 10.23638/LMCS-13(2:1)2017|year = 2017|last1 = Preda|first1 = Mila Dalla|last2 = Gabbrielli|first2 = Maurizio|last3 = Giallorenzo|first3 = Saverio|last4 = Lanese|first4 = Ivan|last5 = Mauro|first5 = Jacopo|title = Dynamic Choreographies: Theory and Implementation|journal = Logical Methods in Computer Science |volume = 13|issue = 2|s2cid = 5555662}}</ref> and [[system integration]].<ref>{{Cite book|chapter-url=https://doi.org/10.1007/978-3-030-02671-4_2|doi = 10.1007/978-3-030-02671-4_2|chapter = ChIP: A Choreographic Integration Process|title = On the Move to Meaningful Internet Systems. OTM 2018 Conferences|series = Lecture Notes in Computer Science|year = 2018|last1 = Giallorenzo|first1 = Saverio|last2 = Lanese|first2 = Ivan|last3 = Russo|first3 = Daniel|volume = 11230|pages = 22–40|isbn = 978-3-030-02670-7| s2cid=53015580 |url = https://findresearcher.sdu.dk:8443/ws/files/153104697/ChIP.pdf}}</ref>

Line 88:

* [[Sequence diagram]]

* [[Service choreography]]

* [[Structured concurrency]]

* [[Multitier programming]]

== References ==