HasChor: Functional Choreographic Programming for All (Functional Pearl)

Shen, Gan; Shun, Kashiwa,; Kuper, Lindsey

doi:10.1145/3607849

Cited by 5 publications

(1 citation statement)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, there has been a fair amount of interest in higher-order and functional programming for choreographies (Hirsch & Garg, 2022;Cruz-Filipe et al, 2022;Shen et al, 2023;Giallorenzo et al, 2023). The first higher-order choreographic programming language, Choral (Giallorenzo et al, 2023) is an object-oriented choreographic language compiled to Java code.…”

Section: Choreographiesmentioning

confidence: 99%

Alice or Bob?: Process polymorphism in choreographies

GRAVERSEN,

HIRSCH,

MONTESI

2024

J. Funct. Prog.

View full text Add to dashboard Cite

We present PolyChor $\lambda$ , a language for higher-order functional choreographic programming—an emerging paradigm for concurrent programming. In choreographic programming, programmers write the desired cooperative behaviour of a system of processes and then compile it into an implementation for each process, a translation called endpoint projection. Unlike its predecessor, Chor $\lambda$ , PolyChor $\lambda$ has both type and process polymorphism inspired by System F $_\omega$ . That is, PolyChor $\lambda$ is the first (higher-order) functional choreographic language which gives programmers the ability to write generic choreographies and determine the participants at runtime. This novel combination of features also allows PolyChor $\lambda$ processes to communicate distributed values, leading to a new and intuitive way to write delegation. While some of the functional features of PolyChor $\lambda$ give it a weaker correspondence between the semantics of choreographies and their endpoint-projected concurrent systems than some other choreographic languages, we still get the hallmark end result of choreographic programming: projected programmes are deadlock-free by design.

show abstract

Section: Choreographiesmentioning

confidence: 99%

Alice or Bob?: Process polymorphism in choreographies

GRAVERSEN,

HIRSCH,

MONTESI

2024

J. Funct. Prog.

View full text Add to dashboard Cite

show abstract

Phases in Software Architecture

Gibbons,

Kidney,

Schrijvers

et al. 2023

Proceedings of the 1st ACM SIGPLAN International Workshop on Functional Software Architecture

View full text Add to dashboard Cite

Type-Safe Dynamic Placement with First-Class Placed Values

Zakhour,

Weisenburger,

Salvaneschi

2023

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Several distributed programming language solutions have been proposed to reason about the placement of data, computations, and peers interaction. Such solutions include, among the others, multitier programming, choreographic programming and various approaches based on behavioral types. These methods statically ensure safety properties thanks to a complete knowledge about placement of data and computation at compile time. In distributed systems, however, dynamic placement of computation and data is crucial to enable performance optimizations, e.g., driven by data locality or in presence of a number of other constraints such as security and compliance regarding data storage location. Unfortunately, in existing programming languages, dynamic placement conflicts with static reasoning about distributed programs: the flexibility required by dynamic placement hinders statically tracking the location of data and computation. In this paper we present Dyno, a programming language that enables static reasoning about dynamic placement. Dyno features a type system where values are explicitly placed, but in contrast to existing approaches, placed values are also first class, ensuring that they can be passed around and referred to from other locations. Building on top of this mechanism, we provide a novel interpretation of dynamic placement as unions of placement types. We formalize type soundness, placement correctness (as part of type soundness) and architecture conformance. In case studies and benchmarks, our evaluation shows that Dyno enables static reasoning about programs even in presence of dynamic placement, ensuring type safety and placement correctness of programs at negligible performance cost. We reimplement an Android app with ∼ 7 K LOC in Dyno, find a bug in the existing implementation, and show that the app's approach is representative of a common way to implement dynamic placement found in over 100 apps in a large open-source app store.

show abstract

HasChor: Functional Choreographic Programming for All (Functional Pearl)

Cited by 5 publications

References 29 publications

Alice or Bob?: Process polymorphism in choreographies

Alice or Bob?: Process polymorphism in choreographies

Phases in Software Architecture

Type-Safe Dynamic Placement with First-Class Placed Values

Contact Info

Product

Resources

About