Algebra of Programming
The Algebra of Programming group researches mathematically sound yet convenient techniques for manipulating and reasoning with programs, with a particular interest in the functional and relational paradigms and in generic programming. It seeks patterns in specifications, algorithms and programs, and abstracts these patterns to derive solutions to general classes of problems. An active weekly seminar consists of interactive problem-solving discussions around the whiteboard.
Faculty
Emeritus Faculty
Students
External
Past Members
Selected Publications
-
Algorithm Design with the Selection Monad
Johannes Hartmann and Jeremy Gibbons
In Wouter Swierstra and Nicolas Wu, editors, Trends in Functional Programming. Vol. 13401 of LNCS. Pages 126−143. 2022.
Details about Algorithm Design with the Selection Monad | BibTeX data for Algorithm Design with the Selection Monad | DOI (10.1007/978-3-031-21314-4_7) | Download (pdf) of Algorithm Design with the Selection Monad
-
Continuation−Passing Style‚ Defunctionalization‚ Accumulations‚ and Associativity
Jeremy Gibbons
In The Art‚ Science‚ and Engineering of Programming. Vol. 6. No. 2. Pages Article 7. 2022.
Recipient of the Reviewers' Choice Award for 2022
Details about Continuation−Passing Style‚ Defunctionalization‚ Accumulations‚ and Associativity | BibTeX data for Continuation−Passing Style‚ Defunctionalization‚ Accumulations‚ and Associativity | DOI (10.22152/programming-journal.org/2022/6/7) | Download (pdf) of Continuation−Passing Style‚ Defunctionalization‚ Accumulations‚ and Associativity
-
Breadth−First Traversal Via Staging
Jeremy Gibbons‚ Oisin Kidney‚ Tom Schrijvers and Nicolas Wu
Vol. 13544 of LNCS. Pages 1−33. 2022.
Details about Breadth−First Traversal Via Staging | BibTeX data for Breadth−First Traversal Via Staging | DOI (10.1007/978-3-031-16912-0_1) | Download (pdf) of Breadth−First Traversal Via Staging