Publications

Note: Not all publications are listed here. Please see people pages.

 

2099.

Details about Note: Not all publications are listed here. Please see people pages. | BibTeX data for Note: Not all publications are listed here. Please see people pages.

Binomial Tabulation: A Short Story

Hsiang−Shang Ko‚ Shin−Cheng Mu and Jeremy Gibbons

February, 2024.

Details about Binomial Tabulation: A Short Story | BibTeX data for Binomial Tabulation: A Short Story | Download (pdf) of Binomial Tabulation: A Short Story

On Learning Polynomial Recursive Programs

Alex Buna−Marginean‚ Vincent Cheval‚ Mahsa Shirmohammadi and James Worrell

In Proc. ACM Program. Lang.. Vol. 8. No. POPL. Pages 1001–1027. 2024.

Details about On Learning Polynomial Recursive Programs | BibTeX data for On Learning Polynomial Recursive Programs | DOI (10.1145/3632876) | Link to On Learning Polynomial Recursive Programs

Profunctor Optics‚ a Categorical Update

Bryce Clarke‚ Derek Elkins‚ Jeremy Gibbons‚ Fosco Loregian‚ Bartosz Milewski‚ Emily Pillmore and Mario Román

No. 1. 2024.

Details about Profunctor Optics‚ a Categorical Update | BibTeX data for Profunctor Optics‚ a Categorical Update | DOI (10.32408/compositionality-6-1) | Link to Profunctor Optics‚ a Categorical Update

Affine Monads and Lazy Structures for Bayesian Programming

Swaraj Dash‚ Younesse Kaddar‚ Hugo Paquet and Sam Staton

In Proc. ACM Program. Lang.. Vol. 7. No. POPL. Pages 1338–1368. 2023.

Details about Affine Monads and Lazy Structures for Bayesian Programming | BibTeX data for Affine Monads and Lazy Structures for Bayesian Programming | DOI (10.1145/3571239) | Link to Affine Monads and Lazy Structures for Bayesian Programming

ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programs

Alexander K. Lew‚ Mathieu Huot‚ Sam Staton and Vikash K. Mansinghka

In Proc. ACM Program. Lang.. Vol. 7. No. POPL. Pages 121–153. 2023.

Details about ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programs | BibTeX data for ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programs | DOI (10.1145/3571198) | Link to ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programs

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

Higher Order Automatic Differentiation of Higher Order Functions

Mathieu Huot‚ Sam Staton and Matthijs Vákár

In Log. Methods Comput. Sci.. Vol. 18. No. 1. 2022.

Details about Higher Order Automatic Differentiation of Higher Order Functions | BibTeX data for Higher Order Automatic Differentiation of Higher Order Functions | DOI (10.46298/lmcs-18(1:41)2022) | Link to Higher Order Automatic Differentiation of Higher Order Functions

Quantum de Finetti Theorems as Categorical Limits‚ and Limits of State Spaces of C*−algebras

Sam Staton and Ned Summers

In CoRR. Vol. abs/2207.05832. 2022.

Details about Quantum de Finetti Theorems as Categorical Limits‚ and Limits of State Spaces of C*−algebras | BibTeX data for Quantum de Finetti Theorems as Categorical Limits‚ and Limits of State Spaces of C*−algebras | DOI (10.48550/arXiv.2207.05832) | Link to Quantum de Finetti Theorems as Categorical Limits‚ and Limits of State Spaces of C*−algebras

Concrete categories and higher−order recursion (With applications including probability‚ differentiability‚ and full abstraction)

Cristina Matache‚ Sean K. Moss and Sam Staton

In CoRR. Vol. abs/2205.15917. 2022.

Details about Concrete categories and higher−order recursion (With applications including probability‚ differentiability‚ and full abstraction) | BibTeX data for Concrete categories and higher−order recursion (With applications including probability‚ differentiability‚ and full abstraction) | DOI (10.48550/arXiv.2205.15917) | Link to Concrete categories and higher−order recursion (With applications including probability‚ differentiability‚ and full abstraction)

Concrete categories and higher−order recursion: With applications including probability‚ differentiability‚ and full abstraction

Cristina Matache‚ Sean K. Moss and Sam Staton

In Christel Baier and Dana Fisman, editors, LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science‚ Haifa‚ Israel‚ August 2 − 5‚ 2022. Pages 57:1–57:14. ACM. 2022.

Details about Concrete categories and higher−order recursion: With applications including probability‚ differentiability‚ and full abstraction | BibTeX data for Concrete categories and higher−order recursion: With applications including probability‚ differentiability‚ and full abstraction | DOI (10.1145/3531130.3533370) | Link to Concrete categories and higher−order recursion: With applications including probability‚ differentiability‚ and full abstraction

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

Probabilistic programming semantics for name generation

Marcin Sabok‚ Sam Staton‚ Dario Stein and Michael Wolman

In Proc. ACM Program. Lang.. Vol. 5. No. POPL. Pages 1–29. 2021.

Details about Probabilistic programming semantics for name generation | BibTeX data for Probabilistic programming semantics for name generation | DOI (10.1145/3434292) | Link to Probabilistic programming semantics for name generation

Higher Order Automatic Differentiation of Higher Order Functions

Mathieu Huot‚ Sam Staton and Matthijs Vákár

In CoRR. Vol. abs/2101.06757. 2021.

Details about Higher Order Automatic Differentiation of Higher Order Functions | BibTeX data for Higher Order Automatic Differentiation of Higher Order Functions | Link to Higher Order Automatic Differentiation of Higher Order Functions

Compositional Semantics for Probabilistic Programs with Exact Conditioning

Dario Stein and Sam Staton

In CoRR. Vol. abs/2101.11351. 2021.

Details about Compositional Semantics for Probabilistic Programs with Exact Conditioning | BibTeX data for Compositional Semantics for Probabilistic Programs with Exact Conditioning | Link to Compositional Semantics for Probabilistic Programs with Exact Conditioning

Some Formal Structures in Probability (Invited Talk)

Sam Staton

In Naoki Kobayashi, editor, 6th International Conference on Formal Structures for Computation and Deduction‚ FSCD 2021‚ July 17−24‚ 2021‚ Buenos Aires‚ Argentina (Virtual Conference). Vol. 195 of LIPIcs. Pages 4:1–4:4. Schloss Dagstuhl − Leibniz−Zentrum für Informatik. 2021.

Details about Some Formal Structures in Probability (Invited Talk) | BibTeX data for Some Formal Structures in Probability (Invited Talk) | DOI (10.4230/LIPIcs.FSCD.2021.4) | Link to Some Formal Structures in Probability (Invited Talk)

Recursion and Sequentiality in Categories of Sheaves

Cristina Matache‚ Sean K. Moss and Sam Staton

In Naoki Kobayashi, editor, 6th International Conference on Formal Structures for Computation and Deduction‚ FSCD 2021‚ July 17−24‚ 2021‚ Buenos Aires‚ Argentina (Virtual Conference). Vol. 195 of LIPIcs. Pages 25:1–25:22. Schloss Dagstuhl − Leibniz−Zentrum für Informatik. 2021.

Details about Recursion and Sequentiality in Categories of Sheaves | BibTeX data for Recursion and Sequentiality in Categories of Sheaves | DOI (10.4230/LIPIcs.FSCD.2021.25) | Link to Recursion and Sequentiality in Categories of Sheaves

Monads for Measurable Queries in Probabilistic Databases

Swaraj Dash and Sam Staton

In Ana Sokolova, editor, Proceedings 37th Conference on Mathematical Foundations of Programming Semantics‚ MFPS 2021‚ Hybrid: Salzburg‚ Austria and Online‚ 30th August − 2nd September‚ 2021. Vol. 351 of EPTCS. Pages 34–50. 2021.

Details about Monads for Measurable Queries in Probabilistic Databases | BibTeX data for Monads for Measurable Queries in Probabilistic Databases | DOI (10.4204/EPTCS.351.3) | Link to Monads for Measurable Queries in Probabilistic Databases

Compositional Semantics for Probabilistic Programs with Exact Conditioning

Dario Stein and Sam Staton

In 36th Annual ACM/IEEE Symposium on Logic in Computer Science‚ LICS 2021‚ Rome‚ Italy‚ June 29 − July 2‚ 2021. Pages 1–13. IEEE. 2021.

Details about Compositional Semantics for Probabilistic Programs with Exact Conditioning | BibTeX data for Compositional Semantics for Probabilistic Programs with Exact Conditioning | DOI (10.1109/LICS52264.2021.9470552) | Link to Compositional Semantics for Probabilistic Programs with Exact Conditioning

Algorithmics

Nicolas Wu Richard S. Bird Jeremy Gibbons Ralf Hinze Peter Hoefner Johan Jeuring Lambert G. L. T. Meertens Bernhard Moeller Carroll Morgan Tom Schrijvers Wouter Swierstra

In Kai Rannenberg Michael Goedicke Erich J. Neuhold, editor, Advancing Research in Information and Communication Technology − IFIP's Exciting First 60+ Years‚ Views from the Technical Committees and Working Groups. Vol. 600 of IFIP Advances in Information and Communication Technology. Pages 59−98. Springer. 2021.

Details about Algorithmics | BibTeX data for Algorithmics | Download of Algorithmics | DOI (10.1007/978-3-030-81701-5_3) | Download (pdf) of Algorithmics

How to Design Co−Programs

Jeremy Gibbons

In Journal of Functional Programming. Vol. 31. No. e15. 2021.

Details about How to Design Co−Programs | BibTeX data for How to Design Co−Programs | DOI (10.1017/S0956796821000113) | Download (pdf) of How to Design Co−Programs

Classical Control‚ Quantum Circuits and Linear Logic in Enriched Category Theory

Mathys Rennela and Sam Staton

In Log. Methods Comput. Sci.. Vol. 16. No. 1. 2020.

Details about Classical Control‚ Quantum Circuits and Linear Logic in Enriched Category Theory | BibTeX data for Classical Control‚ Quantum Circuits and Linear Logic in Enriched Category Theory | DOI (10.23638/LMCS-16(1:30)2020) | Link to Classical Control‚ Quantum Circuits and Linear Logic in Enriched Category Theory

Probabilistic Programming Semantics for Name Generation

Marcin Sabok‚ Sam Staton‚ Dario Stein and Michael Wolman

In CoRR. Vol. abs/2007.08638. 2020.

Details about Probabilistic Programming Semantics for Name Generation | BibTeX data for Probabilistic Programming Semantics for Name Generation | Link to Probabilistic Programming Semantics for Name Generation

Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing

Mathieu Huot‚ Sam Staton and Matthijs Vákár

In CoRR. Vol. abs/2001.02209. 2020.

Details about Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing | BibTeX data for Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing | Link to Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing

De Finetti's Construction as a Categorical Limit

Bart Jacobs and Sam Staton

In Daniela Petrisan and Jurriaan Rot, editors, Coalgebraic Methods in Computer Science − 15th IFIP WG 1.3 International Workshop‚ CMCS 2020‚ Colocated with ETAPS 2020‚ Dublin‚ Ireland‚ April 25−26‚ 2020‚ Proceedings. Vol. 12094 of Lecture Notes in Computer Science. Pages 90–111. Springer. 2020.

Details about De Finetti's Construction as a Categorical Limit | BibTeX data for De Finetti's Construction as a Categorical Limit | DOI (10.1007/978-3-030-57201-3\_6) | Link to De Finetti's Construction as a Categorical Limit

Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing

Mathieu Huot‚ Sam Staton and Matthijs Vákár

In Jean Goubault−Larrecq and Barbara König, editors, Foundations of Software Science and Computation Structures − 23rd International Conference‚ FOSSACS 2020‚ Held as Part of the European Joint Conferences on Theory and Practice of Software‚ ETAPS 2020‚ Dublin‚ Ireland‚ April 25−30‚ 2020‚ Proceedings. Vol. 12077 of Lecture Notes in Computer Science. Pages 319–338. Springer. 2020.

Details about Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing | BibTeX data for Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing | DOI (10.1007/978-3-030-45231-5\_17) | Link to Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing

A Monad for Probabilistic Point Processes

Swaraj Dash and Sam Staton

In David I. Spivak and Jamie Vicary, editors, Proceedings of the 3rd Annual International Applied Category Theory Conference 2020‚ ACT 2020‚ Cambridge‚ USA‚ 6−10th July 2020. Vol. 333 of EPTCS. Pages 19–32. 2020.

Details about A Monad for Probabilistic Point Processes | BibTeX data for A Monad for Probabilistic Point Processes | DOI (10.4204/EPTCS.333.2) | Link to A Monad for Probabilistic Point Processes

The School of Squiggol: A History of the Bird−Meertens Formalism

Jeremy Gibbons

In Troy Astarte, editor, Formal Methods (Workshop on History of Formal Methods). Vol. 12233 of LNCS. Springer. 2020.

Details about The School of Squiggol: A History of the Bird−Meertens Formalism | BibTeX data for The School of Squiggol: A History of the Bird−Meertens Formalism | DOI (10.1007/978-3-030-54997-8_2) | Download (pdf) of The School of Squiggol: A History of the Bird−Meertens Formalism

Quantitative Information Flow with Monads in Haskell

Jeremy Gibbons‚ Annabelle McIver‚ Carroll Morgan and Tom Schrijvers

In Gilles Barthe‚ Joost−Pieter Katoen and Alexandra Silva, editors, Foundations of Probabilistic Programming. Cambridge University Press. 2020.

Details about Quantitative Information Flow with Monads in Haskell | BibTeX data for Quantitative Information Flow with Monads in Haskell | DOI (10.1017/9781108770750) | Download (pdf) of Quantitative Information Flow with Monads in Haskell

Algorithmics

Richard Bird‚ Jeremy Gibbons‚ Ralf Hinze‚ Peter Hoefner‚ Johan Jeuring‚ Lambert Meertens‚ Bernhard Moeller‚ Carroll Morgan‚ Tom Schrijvers‚ Wouter Swierstra and Nicolas Wu

Vol. 600 of IFIP Advances in Information and Communication Technology. July, 2020.

Details about Algorithmics | BibTeX data for Algorithmics | DOI (10.1007/978-3-030-81701-5_3) | Download (pdf) of Algorithmics

Algorithm Design with Haskell

Richard Bird and Jeremy Gibbons

Cambridge University Press. July, 2020.

Details about Algorithm Design with Haskell | BibTeX data for Algorithm Design with Haskell | Link to Algorithm Design with Haskell

A domain theory for statistical probabilistic programming

Matthijs Vákár‚ Ohad Kammar and Sam Staton

In Proc. ACM Program. Lang.. Vol. 3. No. POPL. Pages 36:1–36:29. 2019.

Details about A domain theory for statistical probabilistic programming | BibTeX data for A domain theory for statistical probabilistic programming | DOI (10.1145/3290349) | Link to A domain theory for statistical probabilistic programming

Quantum channels as a categorical completion

Mathieu Huot and Sam Staton

In CoRR. Vol. abs/1904.09600. 2019.

Details about Quantum channels as a categorical completion | BibTeX data for Quantum channels as a categorical completion | Link to Quantum channels as a categorical completion

Quantum channels as a categorical completion

Mathieu Huot and Sam Staton

In 34th Annual ACM/IEEE Symposium on Logic in Computer Science‚ LICS 2019‚ Vancouver‚ BC‚ Canada‚ June 24−27‚ 2019. Pages 1–13. IEEE. 2019.

Details about Quantum channels as a categorical completion | BibTeX data for Quantum channels as a categorical completion | DOI (10.1109/LICS.2019.8785700) | Link to Quantum channels as a categorical completion

Language‚ Logic‚ and Computation − 12th International Tbilisi Symposium‚ TbiLLC 2017‚ Lagodekhi‚ Georgia‚ September 18−22‚ 2017‚ Revised Selected Papers

Alexandra Silva‚ Sam Staton‚ Peter Sutton and Carla Umbach, editors

Details about Language‚ Logic‚ and Computation − 12th International Tbilisi Symposium‚ TbiLLC 2017‚ Lagodekhi‚ Georgia‚ September 18−22‚ 2017‚ Revised Selected Papers | BibTeX data for Language‚ Logic‚ and Computation − 12th International Tbilisi Symposium‚ TbiLLC 2017‚ Lagodekhi‚ Georgia‚ September 18−22‚ 2017‚ Revised Selected Papers | DOI (10.1007/978-3-662-59565-7) | Link to Language‚ Logic‚ and Computation − 12th International Tbilisi Symposium‚ TbiLLC 2017‚ Lagodekhi‚ Georgia‚ September 18−22‚ 2017‚ Revised Selected Papers

A Sound and Complete Logic for Algebraic Effects

Cristina Matache and Sam Staton

In Mikolaj Bojanczyk and Alex Simpson, editors, Foundations of Software Science and Computation Structures − 22nd International Conference‚ FOSSACS 2019‚ Held as Part of the European Joint Conferences on Theory and Practice of Software‚ ETAPS 2019‚ Prague‚ Czech Republic‚ April 6−11‚ 2019‚ Proceedings. Vol. 11425 of Lecture Notes in Computer Science. Pages 382–399. Springer. 2019.

Details about A Sound and Complete Logic for Algebraic Effects | BibTeX data for A Sound and Complete Logic for Algebraic Effects | DOI (10.1007/978-3-030-17127-8\_22) | Link to A Sound and Complete Logic for Algebraic Effects

Coding with Asymmetric Numeral Systems

Jeremy Gibbons

In Mathematics of Program Construction. Vol. 11825 of Lecture Notes in Computer Science. Pages 444−465. Springer. October, 2019.

Details about Coding with Asymmetric Numeral Systems | BibTeX data for Coding with Asymmetric Numeral Systems | DOI (10.1007/978-3-030-33636-3_16) | Download (pdf) of Coding with Asymmetric Numeral Systems

Denotational validation of higher−order Bayesian inference

Adam Ścibior‚ Ohad Kammar‚ Matthijs Vákár‚ Sam Staton‚ Hongseok Yang‚ Yufei Cai‚ Klaus Ostermann‚ Sean K. Moss‚ Chris Heunen and Zoubin Ghahramani

In Proc. ACM Program. Lang.. Vol. 2. No. POPL. Pages 60:1–60:29. 2018.

Details about Denotational validation of higher−order Bayesian inference | BibTeX data for Denotational validation of higher−order Bayesian inference | DOI (10.1145/3158148) | Link to Denotational validation of higher−order Bayesian inference

The Beta−Bernoulli process and algebraic effects

Sam Staton‚ Dario Stein‚ Hongseok Yang‚ Nathanael L. Ackerman‚ Cameron E. Freer and Daniel M. Roy

In CoRR. Vol. abs/1802.09598. 2018.

Details about The Beta−Bernoulli process and algebraic effects | BibTeX data for The Beta−Bernoulli process and algebraic effects | Link to The Beta−Bernoulli process and algebraic effects

A Domain Theory for Statistical Probabilistic Programming

Matthijs Vákár‚ Ohad Kammar and Sam Staton

In CoRR. Vol. abs/1811.04196. 2018.

Details about A Domain Theory for Statistical Probabilistic Programming | BibTeX data for A Domain Theory for Statistical Probabilistic Programming | Link to A Domain Theory for Statistical Probabilistic Programming

The Beta−Bernoulli process and algebraic effects

Sam Staton‚ Dario Stein‚ Hongseok Yang‚ Nathanael L. Ackerman‚ Cameron E. Freer and Daniel M. Roy

In Ioannis Chatzigiannakis‚ Christos Kaklamanis‚ Dániel Marx and Donald Sannella, editors, 45th International Colloquium on Automata‚ Languages‚ and Programming‚ ICALP 2018‚ July 9−13‚ 2018‚ Prague‚ Czech Republic. Vol. 107 of LIPIcs. Pages 141:1–141:15. Schloss Dagstuhl − Leibniz−Zentrum für Informatik. 2018.

Details about The Beta−Bernoulli process and algebraic effects | BibTeX data for The Beta−Bernoulli process and algebraic effects | DOI (10.4230/LIPIcs.ICALP.2018.141) | Link to The Beta−Bernoulli process and algebraic effects

Proceedings of the Thirty−Fourth Conference on the Mathematical Foundations of Programming Semantics‚ MFPS 2018‚ Dalhousie University‚ Halifax‚ Canada‚ June 6−9‚ 2018

Sam Staton, editor