default search action
Patrick Bahr
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c22]Zac Garby, Graham Hutton, Patrick Bahr:
Calculating Compilers Effectively (Functional Pearl). Haskell 2024: 109-119 - [c21]Patrick Bahr, Emil Houlborg, Gregers Thomas Skat Rørdam:
Asynchronous Reactive Programming with Modal Types in Haskell. PADL 2024: 18-36 - 2023
- [j13]Patrick Bahr, Rasmus Ejlers Møgelberg:
Asynchronous Modal FRP. Proc. ACM Program. Lang. 7(ICFP): 476-510 (2023) - [j12]Patrick Bahr, Graham Hutton:
Calculating Compilers for Concurrency. Proc. ACM Program. Lang. 7(ICFP): 740-767 (2023) - [i5]Patrick Bahr, Rasmus Ejlers Møgelberg:
Asynchronous Modal FRP. CoRR abs/2303.03170 (2023) - 2022
- [j11]Patrick Bahr:
Modal FRP for all: Functional reactive programming without space leaks in Haskell. J. Funct. Program. 32: e15 (2022) - [j10]Patrick Bahr, Graham Hutton:
Monadic compiler calculation (functional pearl). Proc. ACM Program. Lang. 6(ICFP): 80-108 (2022) - 2021
- [j9]Patrick Bahr, Christian Uldal Graulund, Rasmus Ejlers Møgelberg:
Diamonds are not forever: liveness in reactive programming with guarded recursion. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - [e2]Patrick Bahr:
Proceedings 11th International Workshop on Computing with Terms and Graphs, TERMGRAPH@FSCD 2020, Online, 5th July 2020. EPTCS 334, 2021 [contents] - 2020
- [j8]Patrick Bahr, Graham Hutton:
Calculating correct compilers II: Return of the register machines. J. Funct. Program. 30: e25 (2020) - [i4]Patrick Bahr, Christian Uldal Graulund, Rasmus Ejlers Møgelberg:
Diamonds are not forever: Liveness in reactive programming with guarded recursion. CoRR abs/2003.03170 (2020)
2010 – 2019
- 2019
- [j7]Patrick Bahr, Christian Graulund, Rasmus Ejlers Møgelberg:
Simply RaTT: a fitch-style modal calculus for reactive programming without space leaks. Proc. ACM Program. Lang. 3(ICFP): 109:1-109:27 (2019) - [i3]Patrick Bahr, Christian Graulund, Rasmus Ejlers Møgelberg:
Simply RaTT: A Fitch-style Modal Calculus for Reactive Programming. CoRR abs/1903.05879 (2019) - 2018
- [j6]Patrick Bahr:
Convergence in infinitary term graph rewriting systems is simple. Math. Struct. Comput. Sci. 28(8): 1363-1414 (2018) - [c20]Patrick Bahr:
Strict Ideal Completions of the Lambda Calculus. FSCD 2018: 8:1-8:16 - [i2]Patrick Bahr:
Strict Ideal Completions of the Lambda Calculus. CoRR abs/1805.06736 (2018) - 2017
- [j5]Graham Hutton, Patrick Bahr:
Compiling a 50-year journey. J. Funct. Program. 27: e20 (2017) - [j4]Patrick Bahr, Emil Axelsson:
Generalising tree traversals and tree transformations to DAGs: Exploiting sharing without the pain. Sci. Comput. Program. 137: 63-97 (2017) - [c19]Patrick Bahr, Hans Bugge Grathwohl, Rasmus Ejlers Møgelberg:
The clocks are ticking: No more delays! LICS 2017: 1-12 - [c18]Patrick Bahr:
Böhm Reduction in Infinitary Term Graph Rewriting Systems. FSCD 2017: 8:1-8:20 - 2016
- [c17]Graham Hutton, Patrick Bahr:
Cutting Out Continuations. A List of Successes That Can Change the World 2016: 187-200 - 2015
- [j3]Patrick Bahr, Graham Hutton:
Calculating correct compilers. J. Funct. Program. 25 (2015) - [c16]Alejandro Serrano, Jurriaan Hage, Patrick Bahr:
Type families with class, type classes with family. Haskell 2015: 129-140 - [c15]Patrick Bahr, Jost Berthold, Martin Elsman:
Certified symbolic management of financial multi-party contracts. ICFP 2015: 315-327 - [c14]Patrick Bahr:
Calculating Certified Compilers for Non-deterministic Languages. MPC 2015: 159-186 - [c13]Patrick Bahr, Emil Axelsson:
Generalising Tree Traversals to DAGs: Exploiting Sharing without the Pain. PEPM 2015: 27-38 - [e1]Patrick Bahr, Sebastian Erdweg:
Proceedings of the 11th ACM SIGPLAN Workshop on Generic Programming, WGP@ICFP 2015, Vancouver, BC, Canada, August 30, 2015. ACM 2015, ISBN 978-1-4503-3810-3 [contents] - 2014
- [j2]Patrick Bahr:
Partial Order Infinitary Term Rewriting. Log. Methods Comput. Sci. 10(2) (2014) - [c12]Patrick Bahr:
Proving Correctness of Compilers Using Structured Graphs. FLOPS 2014: 221-237 - [c11]Patrick Bahr:
Composing and decomposing data types: a closed type families implementation of data types à la carte. WGP@ICFP 2014: 71-82 - [c10]Jesper Andersen, Patrick Bahr, Fritz Henglein, Tom Hvitved:
Domain-Specific Languages for Enterprise Systems. ISoLA (1) 2014: 73-95 - 2013
- [c9]Patrick Bahr, Laurence E. Day:
Programming macro tree transducers. WGP@ICFP 2013: 61-72 - [c8]Patrick Bahr:
Convergence in Infinitary Term Graph Rewriting Systems is Simple (Extended Abstract). TERMGRAPH 2013: 17-28 - 2012
- [j1]Patrick Bahr:
Modes of Convergence for Term Graph Rewriting. Log. Methods Comput. Sci. 8(2) (2012) - [c7]Patrick Bahr:
Modular Tree Automata. MPC 2012: 263-299 - [c6]Patrick Bahr:
Infinitary Term Graph Rewriting is Simple, Sound and Complete. RTA 2012: 69-84 - [c5]Patrick Bahr, Tom Hvitved:
Parametric Compositional Data Types. MSFP 2012: 3-24 - 2011
- [c4]Patrick Bahr, Tom Hvitved:
Compositional data types. WGP@ICFP 2011: 83-94 - [c3]Patrick Bahr:
Modes of Convergence for Term Graph Rewriting. RTA 2011: 139-154 - [i1]Patrick Bahr:
Infinitary Term Graph Rewriting. CoRR abs/1107.0666 (2011) - 2010
- [c2]Patrick Bahr:
Abstract Models of Transfinite Reductions. RTA 2010: 49-66 - [c1]Patrick Bahr:
Partial Order Infinitary Term Rewriting and Böhm Trees. RTA 2010: 67-84
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint