Abstract Models of Transfinite Reductions. - Patrick Bahr (RTA, 2010)

Partial Order Infinitary Term Rewriting and Böhm Trees. - Patrick Bahr (RTA, 2010)

Compositional data types. - Patrick Bahr; Tom Hvitved (WGP@ICFP, 2011)

Infinitary Term Graph Rewriting - Patrick Bahr (CoRR, 2011)

Modular Tree Automata. - Patrick Bahr (MPC, 2012)

Infinitary Term Graph Rewriting is Simple, Sound and Complete. - Patrick Bahr (RTA, 2012)

Parametric Compositional Data Types - Patrick Bahr; Tom Hvitved (MSFP, 2012)

Modes of Convergence for Term Graph Rewriting - Patrick Bahr (Log. Methods Comput. Sci., 2012)

Programming macro tree transducers. - Patrick Bahr; Laurence E. Day (WGP@ICFP, 2013)

Convergence in Infinitary Term Graph Rewriting Systems is Simple (Extended Abstract) - Patrick Bahr (TERMGRAPH, 2013)

Proving Correctness of Compilers Using Structured Graphs. - Patrick Bahr (FLOPS, 2014)

Composing and decomposing data types: a closed type families implementation of data types à la carte. - Patrick Bahr (WGP@ICFP, 2014)

Domain-Specific Languages for Enterprise Systems. - Jesper Andersen; Patrick Bahr; Fritz Henglein; Tom Hvitved (ISoLA (1), 2014)

Partial Order Infinitary Term Rewriting. - Patrick Bahr (Log. Methods Comput. Sci., 2014)

Type families with class, type classes with family. - Alejandro Serrano 001; Jurriaan Hage; Patrick Bahr (Haskell, 2015)

Certified symbolic management of financial multi-party contracts. - Patrick Bahr; Jost Berthold; Martin Elsman (ICFP, 2015)

Calculating Certified Compilers for Non-deterministic Languages. - Patrick Bahr (MPC, 2015)

Generalising Tree Traversals to DAGs: Exploiting Sharing without the Pain. - Patrick Bahr; Emil Axelsson (PEPM, 2015)

Calculating correct compilers. - Patrick Bahr; Graham Hutton (J. Funct. Program., 2015)

Cutting Out Continuations. - Graham Hutton; Patrick Bahr (A List of Successes That Can Change the World, 2016)

The clocks are ticking: No more delays! - Patrick Bahr; Hans Bugge Grathwohl; Rasmus Ejlers Møgelberg (LICS, 2017)

Böhm Reduction in Infinitary Term Graph Rewriting Systems. - Patrick Bahr (FSCD, 2017)

Compiling a 50-year journey. - Graham Hutton; Patrick Bahr (J. Funct. Program., 2017)

Generalising tree traversals and tree transformations to DAGs: Exploiting sharing without the pain. - Patrick Bahr; Emil Axelsson (Sci. Comput. Program., 2017)

Strict Ideal Completions of the Lambda Calculus. - Patrick Bahr (FSCD, 2018)

Convergence in infinitary term graph rewriting systems is simple. - Patrick Bahr (Math. Struct. Comput. Sci., 2018)

Simply RaTT: A Fitch-style Modal Calculus for Reactive Programming. - Patrick Bahr; Christian Graulund; Rasmus Ejlers Møgelberg (CoRR, 2019)

Simply RaTT: a fitch-style modal calculus for reactive programming without space leaks. - Patrick Bahr; Christian Graulund; Rasmus Ejlers Møgelberg (Proc. ACM Program. Lang., 2019)

Calculating correct compilers II: Return of the register machines. - Patrick Bahr; Graham Hutton (J. Funct. Program., 2020)

Diamonds are not forever: liveness in reactive programming with guarded recursion. - Patrick Bahr; Christian Uldal Graulund; Rasmus Ejlers Møgelberg (Proc. ACM Program. Lang., 2021)

Modal FRP for all: Functional reactive programming without space leaks in Haskell. - Patrick Bahr (J. Funct. Program., 2022)

Monadic compiler calculation (functional pearl). - Patrick Bahr; Graham Hutton (Proc. ACM Program. Lang., 2022)

Calculating Compilers for Concurrency. - Patrick Bahr; Graham Hutton (Proc. ACM Program. Lang., 2023)

Asynchronous Modal FRP. - Patrick Bahr; Rasmus Ejlers Møgelberg (Proc. ACM Program. Lang., 2023)

Calculating Compilers Effectively (Functional Pearl). - Zac Garby; Graham Hutton; Patrick Bahr (Haskell, 2024)

Asynchronous Reactive Programming with Modal Types in Haskell. - Patrick Bahr; Emil Houlborg; Gregers Thomas Skat Rørdam (PADL, 2024)

Beyond Trees: Calculating Graph-Based Compilers (Functional Pearl). - Patrick Bahr; Graham Hutton (Proc. ACM Program. Lang., 2024)