16 citations · 24 across the 9 of their papers we have counts for
11 papers
Garlene: Guarded Recursion in Lean
Sergei Stepanenko, Patrick Bahr, Rasmus Ejlers Møgelberg
Extending the recursion principles of a formal system is an enticing but dangerous endeavour with a well-documented history of leading to consistency bugs. Nakano's guarded recursi…
Asynchronous Modal FRP
Patrick Bahr, Rasmus Ejlers Møgelberg
Over the past decade, a number of languages for functional reactive programming (FRP) have been suggested, which use modal types to ensure properties like causality, productivity a…
Proceedings 11th International Workshop on Computing with Terms and Graphs
Patrick Bahr
Graphs, and graph transformation systems, are used in many areas within Computer Science: to represent data structures and algorithms, to define computation models, as a general mo…
Diamonds are not forever: Liveness in reactive programming with guarded recursion
Patrick Bahr, Christian Uldal Graulund, Rasmus Møgelberg
When designing languages for functional reactive programming (FRP) the main challenge is to provide the user with a simple, flexible interface for writing programs on a high level…
Simply RaTT: A Fitch-style Modal Calculus for Reactive Programming without Space Leaks
Patrick Bahr, Christian Graulund, Rasmus Møgelberg
Functional reactive programming (FRP) is a paradigm for programming with signals and events, allowing the user to describe reactive programs on a high level of abstraction. For thi…
Strict Ideal Completions of the Lambda Calculus
Patrick Bahr
The infinitary lambda calculi pioneered by Kennaway et al. extend the basic lambda calculus by metric completion to infinite terms and reductions. Depending on the chosen metric, t…
Partial Order Infinitary Term Rewriting
Patrick Bahr
We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We co…
Convergence in Infinitary Term Graph Rewriting Systems is Simple (Extended Abstract)
Patrick Bahr
In this extended abstract, we present a simple approach to convergence on term graphs that allows us to unify term graph rewriting and infinitary term rewriting. This approach is b…
Modes of Convergence for Term Graph Rewriting
Patrick Bahr
Term graph rewriting provides a simple mechanism to finitely represent restricted forms of infinitary term rewriting. The correspondence between infinitary term rewriting and term…
Parametric Compositional Data Types
Patrick Bahr, Tom Hvitved
In previous work we have illustrated the benefits that compositional data types (CDTs) offer for implementing languages and in general for dealing with abstract syntax trees (ASTs)…
Infinitary Term Graph Rewriting
Patrick Bahr
Term graph rewriting provides a formalism for implementing term rewriting in an efficient manner by avoiding duplication. Infinitary term rewriting has been introduced to study inf…