output
20092026
most citedPolynomial Size Analysis of First-Order Shapely Functions

40 citations

researchers with a paper here
collaborating institutions
Showing cs.PLShow all

6 papers · 1 filter

cs.PL2024★ 3 cited

CF-GKAT: Efficient Validation of Control-Flow Transformations

Cheng Zhang, Tobias Kappé, David E. Narváez +1

Guarded Kleene Algebra with Tests (GKAT) provides a sound and complete framework to reason about trace equivalence between simple imperative programs. However, there are still seve…

cs.PL2024★ 1 cited

Example-Based Reasoning about the Realizability of Polymorphic Programs

Niek Mulleners, Johan Jeuring, Bastiaan Heeren

Parametricity states that polymorphic functions behave the same regardless of how they are instantiated. When developing polymorphic programs, Wadler's free theorems can serve as f…

cs.PL2023

Choreographic Programming of Isolated Transactions

Ton Smeele, Sung-Shik Jongmans

Implementing distributed systems is hard; choreographic programming aims to make it easier. In this paper, we present the design of a new choreographic programming language that su…

cs.PL2022★ 7 cited

Branching Pomsets for Choreographies

Luc Edixhoven, Sung-Shik Jongmans, José Proença +1

Choreographic languages describe possible sequences of interactions among a set of agents. Typical models are based on languages or automata over sending and receiving actions. Pom…

cs.PL2016★ 2 cited

Proceedings of the 4th and 5th International Workshop on Trends in Functional Programming in Education

Johan Jeuring, Jay McCarthy

This volume contains the proceedings of the Fourth and Fifth International Workshops on Trends in Functional Programming in Education, TFPIE 2015 and TFPIE 2016, which were held on…

cs.PL2016★ 1 cited

Data optimizations for constraint automata

Sung-Shik T. Q. Jongmans, Farhad Arbab

Constraint automata (CA) constitute a coordination model based on finite automata on infinite words. Originally introduced for modeling of coordinators, an interesting new applicat…