Patrick Bahr

Proc. ACM Program. Lang., 2024

Asynchronous Reactive Programming with Modal Types in Haskell.

[BibT_eX]

[DOI]

Gregers Thomas Skat Rørdam

Emil Houlborg

Proceedings of the Practical Aspects of Declarative Languages, 2024

Calculating Compilers Effectively (Functional Pearl).

[BibT_eX]

[DOI]

Zac Garby

Proceedings of the 17th ACM SIGPLAN International Haskell Symposium, 2024

2023

Asynchronous Modal FRP.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., August, 2023

Calculating Compilers for Concurrency.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., August, 2023

2022

Monadic compiler calculation (functional pearl).

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2022

Modal FRP for all: Functional reactive programming without space leaks in Haskell.

[BibT_eX]

[DOI]

J. Funct. Program., 2022

2021

Diamonds are not forever: liveness in reactive programming with guarded recursion.

[BibT_eX]

[DOI]

Christian Uldal Graulund

Proc. ACM Program. Lang., 2021

2020

Calculating correct compilers II: Return of the register machines.

[BibT_eX]

[DOI]

J. Funct. Program., 2020

2019

Simply RaTT: a fitch-style modal calculus for reactive programming without space leaks.

[BibT_eX]

[DOI]

Christian Graulund

Proc. ACM Program. Lang., 2019

Simply RaTT: A Fitch-style Modal Calculus for Reactive Programming.

[BibT_eX]

[DOI]

Christian Graulund

CoRR, 2019

2018

Convergence in infinitary term graph rewriting systems is simple.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2018

Strict Ideal Completions of the Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

2017

Generalising tree traversals and tree transformations to DAGs: Exploiting sharing without the pain.

[BibT_eX]

[DOI]

Emil Axelsson

Sci. Comput. Program., 2017

Compiling a 50-year journey.

[BibT_eX]

[DOI]

J. Funct. Program., 2017

Böhm Reduction in Infinitary Term Graph Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

The clocks are ticking: No more delays!

[BibT_eX]

[DOI]

Hans Bugge Grathwohl

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Cutting Out Continuations.

[BibT_eX]

[DOI]

Proceedings of the A List of Successes That Can Change the World, 2016

2015

Calculating correct compilers.

[BibT_eX]

[DOI]

J. Funct. Program., 2015

Generalising Tree Traversals to DAGs: Exploiting Sharing without the Pain.

[BibT_eX]

[DOI]

Emil Axelsson

Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation, 2015

Calculating Certified Compilers for Non-deterministic Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Program Construction - 12th International Conference, 2015

Certified symbolic management of financial multi-party contracts.

[BibT_eX]

[DOI]

Jost Berthold

Martin Elsman

Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

Type families with class, type classes with family.

[BibT_eX]

[DOI]

Alejandro Serrano

Jurriaan Hage

Proceedings of the 8th ACM SIGPLAN Symposium on Haskell, 2015

2014

Partial Order Infinitary Term Rewriting.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2014

Domain-Specific Languages for Enterprise Systems.

[BibT_eX]

[DOI]

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2014

Composing and decomposing data types: a closed type families implementation of data types à la carte.

[BibT_eX]

[DOI]

Proceedings of the 10th ACM SIGPLAN workshop on Generic programming, 2014

Proving Correctness of Compilers Using Structured Graphs.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming - 12th International Symposium, 2014

2013

Convergence in Infinitary Term Graph Rewriting Systems is Simple (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the Proceedings 7th International Workshop on Computing with Terms and Graphs, 2013

Programming macro tree transducers.

[BibT_eX]

[DOI]

Laurence E. Day

Proceedings of the 9th ACM SIGPLAN workshop on Generic programming, 2013

2012

Modes of Convergence for Term Graph Rewriting

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

Parametric Compositional Data Types

[BibT_eX]

[DOI]

Tom Hvitved

Proceedings of the Proceedings Fourth Workshop on Mathematically Structured Functional Programming, 2012

Infinitary Term Graph Rewriting is Simple, Sound and Complete.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

Modular Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Program Construction - 11th International Conference, 2012

2011

Infinitary Term Graph Rewriting

[BibT_eX]

[DOI]

CoRR, 2011

Compositional data types.

[BibT_eX]

[DOI]

Tom Hvitved

Proceedings of the seventh ACM SIGPLAN workshop on Generic programming, 2011

2010

Partial Order Infinitary Term Rewriting and Böhm Trees.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Abstract Models of Transfinite Reductions.

[BibT_eX]

[DOI]