Algebra of Programming: Publications

Books

• [1]

  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

• [2]

  Bidirectional Transformations

  Jeremy Gibbons and Perdita Stevens

  Vol. 9715 of LNCS. Springer. 2018.

  Details about Bidirectional Transformations | BibTeX data for Bidirectional Transformations | DOI (10.1007/978-3-319-79108-1) | Link to Bidirectional Transformations

• [3]

  The Fun of Programming

  Jeremy Gibbons and Oege de Moor

  Palgrave. 2003.

  Hardback ISBN: 1−4039−0772−2

  Details about The Fun of Programming | BibTeX data for The Fun of Programming

• [4]

  Summer School on Generic Programming

  Roland Backhouse and Jeremy Gibbons

  Vol. 2793 of Lecture Notes in Computer Science. Springer−Verlag. 2003.

  Details about Summer School on Generic Programming | BibTeX data for Summer School on Generic Programming | Download (pdf) of Summer School on Generic Programming

• [5]

  Algebraic and Coalgebraic Methods in the Mathematics of Program Construction

  Roland Backhouse‚ Roy Crole and Jeremy Gibbons

  Vol. 2297 of Lecture Notes in Computer Science. Springer−Verlag. 2002.

  Details about Algebraic and Coalgebraic Methods in the Mathematics of Program Construction | BibTeX data for Algebraic and Coalgebraic Methods in the Mathematics of Program Construction | Download (pdf) of Algebraic and Coalgebraic Methods in the Mathematics of Program Construction

• [6]

  Introduction to Functional Programming Using Haskell

  Richard S. Bird

  Prentice−Hall. 1998.

  Details about Introduction to Functional Programming Using Haskell | BibTeX data for Introduction to Functional Programming Using Haskell | Link to Introduction to Functional Programming Using Haskell

• [7]

  The Algebra of Programming

  Richard Bird and Oege de Moor

  Prentice−Hall. 1996.

  Details about The Algebra of Programming | BibTeX data for The Algebra of Programming | Link to The Algebra of Programming

• [8]

  Deduktive Datenbanken — Eine Einführung aus der Sicht der logischen Programmierung

  Armin B. Cremers‚ Ulrike Griefahn and Ralf Hinze

  Vieweg, Braunschweig/Wiesbaden. 1994.

  Details about Deduktive Datenbanken — Eine Einführung aus der Sicht der logischen Programmierung | BibTeX data for Deduktive Datenbanken — Eine Einführung aus der Sicht der logischen Programmierung

• [9]

  Einführung in die funktionale Programmierung mit Miranda

  Ralf Hinze

  B.G. Teubner, Stuttgart. 1992.

  Details about Einführung in die funktionale Programmierung mit Miranda | BibTeX data for Einführung in die funktionale Programmierung mit Miranda

• [10]

  An Introduction to Functional Programming

  Richard S. Bird and Philip L. Wadler

  Prentice−Hall. 1988.

  Details about An Introduction to Functional Programming | BibTeX data for An Introduction to Functional Programming

• [11]

  Programs and Machines

  Richard Bird

  Wiley. 1976.

  Details about Programs and Machines | BibTeX data for Programs and Machines

Book chapters

• [1]

  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 | DOI (10.1007/978-3-030-81701-5_3)

• [2]

  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

• [3]

  Extensible and Modular Generics for the Masses

  Ralf Hinze Bruno C. d. S. Oliveira and Andres Loeh

  In Henrik Nilsson, editor, Trends in Functional Programming. 2007.

  Best student paper award

  Details about Extensible and Modular Generics for the Masses | BibTeX data for Extensible and Modular Generics for the Masses

• [4]

  Generic Programming‚ Now!

  Ralf Hinze and Andres Löh

  In Roland Backhouse‚ Jeremy Gibbons‚ Ralf Hinze and Johan Jeuring, editors, Datatype−Generic Programming. Vol. 4719 of Lecture Notes in Computer Science. Pages 150−208. Springer Berlin / Heidelberg. 2007.

  Details about Generic Programming‚ Now! | BibTeX data for Generic Programming‚ Now! | DOI (10.1007/978-3-540-76786-2\_3)

• [5]

  Comparing Approaches to Generic Programming in Haskell

  Ralf Hinze‚ Johan Jeuring and Andres Löh

  In Roland Backhouse‚ Jeremy Gibbons‚ Ralf Hinze and Johan Jeuring, editors, Datatype−Generic Programming. Vol. 4719 of Lecture Notes in Computer Science. Pages 72−149. Springer Berlin / Heidelberg. 2007.

  Details about Comparing Approaches to Generic Programming in Haskell | BibTeX data for Comparing Approaches to Generic Programming in Haskell | DOI (10.1007/978-3-540-76786-2\_2)

• [6]

  Fun with phantom types

  Ralf Hinze

  In Jeremy Gibbons and Oege de Moor, editors, The Fun of Programming. Pages 245−262. Palgrave Macmillan. 2003.

  Details about Fun with phantom types | BibTeX data for Fun with phantom types

• [7]

  Origami Programming

  Jeremy Gibbons

  In Jeremy Gibbons and Oege de Moor, editors, The Fun of Programming. Pages 41−60. Palgrave. 2003.

  Details about Origami Programming | BibTeX data for Origami Programming | Download (pdf) of Origami Programming

• [8]

  Algebraic Methods for Optimization Problems

  Richard Bird‚ Jeremy Gibbons and Shin Cheng Mu

  In Roland Backhouse‚ Roy Crole and Jeremy Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. Vol. 2297 of Lecture Notes in Computer Science. Pages 281–307. Springer−Verlag. 2002.

  Details about Algebraic Methods for Optimization Problems | BibTeX data for Algebraic Methods for Optimization Problems | Download (pdf) of Algebraic Methods for Optimization Problems

• [9]

  Calculating Functional Programs

  Jeremy Gibbons

  In Roland Backhouse‚ Roy Crole and Jeremy Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. Vol. 2297 of Lecture Notes in Computer Science. Pages 148–203. Springer−Verlag. 2002.

  Details about Calculating Functional Programs | BibTeX data for Calculating Functional Programs | Download (pdf) of Calculating Functional Programs

• [10]

  Algebraic Methods for Optimization Problems

  Richard Bird‚ Jeremy Gibbons and Shin Cheng Mu

  In Roland Backhouse‚ Roy Crole and Jeremy Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. Vol. 2297 of Lecture Notes in Computer Science. Pages 281–307. Springer−Verlag. 2002.

  Details about Algebraic Methods for Optimization Problems | BibTeX data for Algebraic Methods for Optimization Problems | Download (pdf) of Algebraic Methods for Optimization Problems

• [11]

  Projektionsbasierte Striktheitsanalyse

  Ralf Hinze

  In Ausgezeichnete Informatikdissertationen 1996. Pages 46−61. B.G. Teubner, Stuttgart. 1998.

  Details about Projektionsbasierte Striktheitsanalyse | BibTeX data for Projektionsbasierte Striktheitsanalyse

• [12]

  The Algebra of Programming

  Richard Bird and Oege de Moor

  In Manfred Broy, editor, Proceedings of the NATO Advanced Study Institute on Deductive Program Design. Pages 167−203. Springer−Verlag. 1994.

  Details about The Algebra of Programming | BibTeX data for The Algebra of Programming | Link to The Algebra of Programming

• [13]

  Relational Program Derivation and Context−Free Language Recognition

  Richard Bird and Oege de Moor

  In A. W. Roscoe, editor, A Classical Mind: Essays in Honour of C.A.R.Hoare. Chapter 2. Prentice−Hall. 1994.

  Details about Relational Program Derivation and Context−Free Language Recognition | BibTeX data for Relational Program Derivation and Context−Free Language Recognition

• [14]

  Die Rolle der mathematischen Logik in der Künstlichen Intelligenz

  Armin B. Cremers‚ Elmar Eder and Ralf Hinze

  In Künstliche Intelligenz: Leitvorstellungen und Verantwortbarkeit‚ Band 1: Diskussionsgrundlage. Verein Deutscher Ingenieure. 1993.

  Details about Die Rolle der mathematischen Logik in der Künstlichen Intelligenz | BibTeX data for Die Rolle der mathematischen Logik in der Künstlichen Intelligenz

• [15]

  Small Specification Exercises

  Richard S. Bird

  In W. H. J. Feijen‚ A. J. M. van Gasteren‚ D. Gries and J. Misra, editors, Beauty is our Business. Pages 36–43. Springer−Verlag. 1990.

  Details about Small Specification Exercises | BibTeX data for Small Specification Exercises

• [16]

  A Calculus of Functions for Program Derivation

  Richard S. Bird

  In David A. Turner, editor, Research Topics in Functional Programming. Addison−Wesley. 1990.

  Also available as Technical Monograph PRG−64‚ from the Programming Research Group‚ Oxford University

  Details about A Calculus of Functions for Program Derivation | BibTeX data for A Calculus of Functions for Program Derivation

• [17]

  Two Exercises Found In a Book on Algorithmics

  Richard S. Bird and Lambert Meertens

  In Lambert Meertens, editor, Program Specification and Transformation. Pages 451–457. North−Holland. 1987.

  Details about Two Exercises Found In a Book on Algorithmics | BibTeX data for Two Exercises Found In a Book on Algorithmics

• [18]

  An Introduction to the Theory of Lists

  Richard S. Bird

  In M. Broy, editor, Logic of Programming and Calculi of Discrete Design. Pages 3–42. Springer−Verlag. 1987.

  NATO ASI Series F Volume 36. Also available as Technical Monograph PRG−56‚ from the Programming Research Group‚ Oxford University

  Details about An Introduction to the Theory of Lists | BibTeX data for An Introduction to the Theory of Lists

Journal papers

• [1]

  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

• [2]

  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

• [3]

  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

• [4]

  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

• [5]

  On "Methodological Irregularities in Programming Language Research"

  Jeremy Gibbons

  In IEEE Computer. Vol. 51. No. 4. Pages 4−7. April, 2018.

  Details about On "Methodological Irregularities in Programming Language Research" | BibTeX data for On "Methodological Irregularities in Programming Language Research" | DOI (10.1109/MC.2018.2141027) | Download (pdf) of On "Methodological Irregularities in Programming Language Research"

• [6]

  Relational Algebra by Way of Adjunctions

  Jeremy Gibbons‚ Fritz Henglein‚ Ralf Hinze and Nicolas Wu

  In PACMPL. Vol. 2. No. ICFP. September, 2018.

  Winner of a Distinguished Paper Award

  Details about Relational Algebra by Way of Adjunctions | BibTeX data for Relational Algebra by Way of Adjunctions | DOI (10.1145/3236781) | Download (pdf) of Relational Algebra by Way of Adjunctions

• [7]

  What You Needa Know About Yoneda: Profunctor Optics and the Yoneda Lemma

  Guillaume Boisseau and Jeremy Gibbons

  In PACMPL. Vol. 2. No. ICFP. September, 2018.

  Functional Pearl

  Details about What You Needa Know About Yoneda: Profunctor Optics and the Yoneda Lemma | BibTeX data for What You Needa Know About Yoneda: Profunctor Optics and the Yoneda Lemma | DOI (10.1145/3236779) | Download (pdf) of What You Needa Know About Yoneda: Profunctor Optics and the Yoneda Lemma

• [8]

  Introduction to Bidirectional Transformations

  Faris Abou−Saleh‚ James Cheney‚ Jeremy Gibbons‚ James McKinna and Perdita Stevens

  Vol. 9715 of LNCS. Pages 1−28. 2018.

  Details about Introduction to Bidirectional Transformations | BibTeX data for Introduction to Bidirectional Transformations | DOI (10.1007/978-3-319-79108-1_1) | Download (pdf) of Introduction to Bidirectional Transformations

• [9]

  Coalgebraic Aspects of Bidirectional Computation

  Faris Abou−Saleh‚ James McKinna and Jeremy Gibbons

  In Journal of Object Technology. Vol. 16. No. 1. Pages 1:1−29. 2017.

  Details about Coalgebraic Aspects of Bidirectional Computation | BibTeX data for Coalgebraic Aspects of Bidirectional Computation | DOI (10.5381/jot.2017.16.1.a1) | Download (pdf) of Coalgebraic Aspects of Bidirectional Computation

• [10]

  On Principles of Least Change and Least Surprise for Bidirectional Transformations

  James Cheney‚ Jeremy Gibbons‚ James McKinna and Perdita Stevens

  In Journal of Object Technology. Vol. 16. No. 1. Pages 3:1−31. 2017.

  Details about On Principles of Least Change and Least Surprise for Bidirectional Transformations | BibTeX data for On Principles of Least Change and Least Surprise for Bidirectional Transformations | DOI (10.5381/jot.2017.16.1.a3) | Download (pdf) of On Principles of Least Change and Least Surprise for Bidirectional Transformations

• [11]

  Programming with Ornaments

  Hsiang−Shang Ko and Jeremy Gibbons

  In Journal of Functional Programming. Vol. 27. December, 2016.

  Details about Programming with Ornaments | BibTeX data for Programming with Ornaments | DOI (10.1017/S0956796816000307) | Download (pdf) of Programming with Ornaments

• [12]

  Bidirectional Transformation is Effectful

  Faris Abou−Saleh‚ James Cheney‚ Jeremy Gibbons‚ James McKinna and Perdita Stevens

  May, 2015.

  This is an abstract of the paper "Notions of Bidirectional Computation and Entangled State Monads"‚ to appear at MPC 2015

  Details about Bidirectional Transformation is Effectful | BibTeX data for Bidirectional Transformation is Effectful | Download (pdf) of Bidirectional Transformation is Effectful

• [13]

  Modularising inductive families

  Hsiang−Shang Ko and Jeremy Gibbons

  In Progress in Informatics. No. 10. Pages 65−88. 2013.

  Details about Modularising inductive families | BibTeX data for Modularising inductive families | DOI (10.2201/NiiPi.2013.10.5) | Download (pdf) of Modularising inductive families

• [14]

  Refactoring Pattern Matching

  Meng Wang‚ Jeremy Gibbons‚ Kazutaka Matsuda and Zhenjiang Hu

  In Science of Computer Programming. Vol. 78. No. 11. Pages 2216−2242. January, 2012.

  Revised version of the MPC2010 paper "Gradual Refinement"

  Details about Refactoring Pattern Matching | BibTeX data for Refactoring Pattern Matching | DOI (10.1016/j.scico.2012.07.014) | Download (pdf) of Refactoring Pattern Matching

• [15]

  A Functional Derivation of the Warren Abstract Machine

  Maciej Pirog and Jeremy Gibbons

  2011.

  Submitted for publication

  Details about A Functional Derivation of the Warren Abstract Machine | BibTeX data for A Functional Derivation of the Warren Abstract Machine | Download (pdf) of A Functional Derivation of the Warren Abstract Machine

• [16]

  Scala for Generic Programmers

  Bruno C. d. S. Oliveira and Jeremy Gibbons

  In Journal of Functional Programming. Vol. 20. No. 3‚4. Pages 303−352. 2010.

  Revised version of the WGP2008 paper

  Details about Scala for Generic Programmers | BibTeX data for Scala for Generic Programmers | DOI (10.1017/S0956796810000171) | Download (pdf) of Scala for Generic Programmers

• [17]

  Comparing Datatype Generic Libraries in Haskell

  Bruno C. d. S. Oliveira Alexey Rodriguez Johan Jeuring Patrik Jansson Alex Gerdes Oleg Kiselyov

  In Journal of Functional Programming. 2009.

  Revised version of the Haskell Symposium 2008 paper

  Details about Comparing Datatype Generic Libraries in Haskell | BibTeX data for Comparing Datatype Generic Libraries in Haskell

• [18]

  The Essence of the Iterator Pattern

  Jeremy Gibbons and Bruno César dos Santos Oliveira

  In Journal of Functional Programming. Vol. 19. No. 3&4. Pages 377−402. 2009.

  Revised version of Gibbons&Oliveira2006:Essence

  Details about The Essence of the Iterator Pattern | BibTeX data for The Essence of the Iterator Pattern | DOI (10.1017/S0956796809007291) | Download (pdf) of The Essence of the Iterator Pattern

• [19]

  Generalising the Array Split Obfuscation

  Stephen Drape

  In Information Sciences. Vol. 177. No. 1. Pages 202–219. January, 2007.

  Details about Generalising the Array Split Obfuscation | BibTeX data for Generalising the Array Split Obfuscation | DOI (10.1016/j.ins.2006.03.012)

• [20]

  Generic Programming in 3D

  Ralf Hinze and Andres Löh

  In Science of Computer Programming. 2007.

  to appear

  Details about Generic Programming in 3D | BibTeX data for Generic Programming in 3D

• [21]

  Minimal On−line List Labelling

  Richard S. Bird and Stefan Sadnicki

  In Information Processing Letters. Vol. 101. No. 1. Pages 41−45. 2007.

  Details about Minimal On−line List Labelling | BibTeX data for Minimal On−line List Labelling

• [22]

  Metamorphisms: Streaming Representation−Changers

  Jeremy Gibbons

  In Science of Computer Programming. Vol. 65. No. 2. Pages 108−139. 2007.

  Details about Metamorphisms: Streaming Representation−Changers | BibTeX data for Metamorphisms: Streaming Representation−Changers | DOI (10.1016/j.scico.2006.01.006) | Download (pdf) of Metamorphisms: Streaming Representation−Changers

• [23]

  Finding Celebrities: A Lesson in Functional Programming

  Richard S. Bird and Sharon Curtis

  In Journal of Functional Programming. Vol. 16. No. 1. Pages 13−20. 2006.

  Details about Finding Celebrities: A Lesson in Functional Programming | BibTeX data for Finding Celebrities: A Lesson in Functional Programming | DOI (10.1017/S0956796805005678)

• [24]

  Enumerating the Rationals

  Jeremy Gibbons‚ David Lester and Richard Bird

  In Journal of Functional Programming. Vol. 16. No. 3. Pages 281−292. 2006.

  Details about Enumerating the Rationals | BibTeX data for Enumerating the Rationals | Download (pdf) of Enumerating the Rationals

• [25]

  A Program to Solve Sudoku

  Richard S. Bird

  In Journal of Functional Programming. Vol. 16. No. 6. Pages 671−679. 2006.

  Details about A Program to Solve Sudoku | BibTeX data for A Program to Solve Sudoku | DOI (10.1017/S0956796806006058)

• [26]

  Enumerating the Rationals

  Jeremy Gibbons‚ David Lester and Richard Bird

  In Journal of Functional Programming. Vol. 16. No. 4. 2006.

  Details about Enumerating the Rationals | BibTeX data for Enumerating the Rationals | DOI (10.1017/S0956796806005880) | Download (pdf) of Enumerating the Rationals

• [27]

  An Unbounded Spigot Algorithm for the Digits of Pi

  Jeremy Gibbons

  In American Mathematical Monthly. Vol. 113. No. 4. Pages 318−328. April, 2006.

  Reprinted on p245−257 of "Pi: The Next Generation"‚ ed David H. Bailey and Jonathan M. Borwein‚ Springer 2016‚ ISBN 978−3−319−32377−0

  Details about An Unbounded Spigot Algorithm for the Digits of Pi | BibTeX data for An Unbounded Spigot Algorithm for the Digits of Pi | Download (pdf) of An Unbounded Spigot Algorithm for the Digits of Pi

• [28]

  Countdown: A Case Study in Origami Programming

  Richard S. Bird and Shin−Cheng Mu

  In Journal of Functional Programming. Vol. 15. No. 5. Pages 679−702. 2005.

  Details about Countdown: A Case Study in Origami Programming | BibTeX data for Countdown: A Case Study in Origami Programming | DOI (10.1017/S0956796805005642)

• [29]

  Proof Methods for Corecursive Programs

  Jeremy Gibbons and Graham Hutton

  In Fundamenta Informaticae. Vol. 66. No. 4. Pages 353−366. 2005.

  Details about Proof Methods for Corecursive Programs | BibTeX data for Proof Methods for Corecursive Programs | Download (pdf) of Proof Methods for Corecursive Programs

• [30]

  Type−indexed data types

  Ralf Hinze‚ Johan Jeuring and Andres Löh

  In Science of Computer Programming. Vol. 51. No. 1−2. Pages 117−151. May, 2004.

  Details about Type−indexed data types | BibTeX data for Type−indexed data types | DOI (10.1016/j.scico.2003.07.001)

• [31]

  Theory and Applications of Inverting Functions as Folds

  Shin−Cheng Mu and Richard S. Bird

  In Science of Computer Programming. Vol. 51. No. 1−2. Pages 87−116. 2004.

  Details about Theory and Applications of Inverting Functions as Folds | BibTeX data for Theory and Applications of Inverting Functions as Folds | DOI (10.1016/j.scico.2003.09.003)

• [32]

  On Tiling a Chessboard

  Richard S. Bird

  In Journal of Functional Programming. Vol. 14. No. 6. Pages 613−622. 2004.

  Details about On Tiling a Chessboard | BibTeX data for On Tiling a Chessboard | DOI (10.1017/S095679680400512X)

• [33]

  Inverting the Burrows−Wheeler Transform

  Richard S. Bird and Shin−Cheng Mu

  In Journal of Functional Programming. Vol. 14. No. 6. Pages 603−612. 2004.

  Earlier version appeared at Haskell Workshop 2001

  Details about Inverting the Burrows−Wheeler Transform | BibTeX data for Inverting the Burrows−Wheeler Transform | DOI (10.1017/S0956796804005118) | Download (pdf) of Inverting the Burrows−Wheeler Transform

• [34]

  Disciplined‚ efficient‚ generalised folds for nested datatypes

  Clare Martin‚ Jeremy Gibbons and Ian Bayley

  In Formal Aspects of Computing. Vol. 16. No. 1. Pages 19−35. 2004.

  Details about Disciplined‚ efficient‚ generalised folds for nested datatypes | BibTeX data for Disciplined‚ efficient‚ generalised folds for nested datatypes | DOI (10.1007/s00165-003-0013-6) | Download (pdf) of Disciplined‚ efficient‚ generalised folds for nested datatypes

• [35]

  Polytypic values possess polykinded types

  Ralf Hinze

  In Science of Computer Programming. Vol. 43. No. 2−3. Pages 129−159. 2002.

  Details about Polytypic values possess polykinded types | BibTeX data for Polytypic values possess polykinded types | DOI (10.1016/S0167-6423(02)00025-4)

• [36]

  Manufacturing datatypes

  Ralf Hinze

  In JFP. Vol. 11. No. 5. Pages 493−524. September, 2001.

  Details about Manufacturing datatypes | BibTeX data for Manufacturing datatypes | DOI (10.1017/S095679680100404X)

• [37]

  Functional Pearl: Weaving a web

  Ralf Hinze and Johan Jeuring

  In JFP. Vol. 11. No. 6. Pages 681−689. November, 2001.

  Details about Functional Pearl: Weaving a web | BibTeX data for Functional Pearl: Weaving a web | DOI (10.1017/S0956796801004129)

• [38]

  Prolog's Control Constructs in a Functional Setting — Axioms and Implementation

  Ralf Hinze

  In IJFCS. Vol. 12. No. 2. Pages 125−170. 2001.

  Details about Prolog's Control Constructs in a Functional Setting — Axioms and Implementation | BibTeX data for Prolog's Control Constructs in a Functional Setting — Axioms and Implementation | DOI (10.1142/S0129054101000436)

• [39]

  Unfolding Pointer Algorithms

  Richard S. Bird

  In Journal of Functional Programming. Vol. 11. No. 3. Pages 347−358. 2001.

  Details about Unfolding Pointer Algorithms | BibTeX data for Unfolding Pointer Algorithms | DOI (10.1017/S0956796801003914) | Download (pdf) of Unfolding Pointer Algorithms

• [40]

  Maximum Marking Problems

  Richard S. Bird

  In Journal of Functional Programming. Vol. 11. No. 4. Pages 411−424. 2001.

  Details about Maximum Marking Problems | BibTeX data for Maximum Marking Problems | DOI (10.1017/S0956796801004038) | Download (pdf) of Maximum Marking Problems

• [41]

  The Generic Approximation Lemma

  Graham Hutton and Jeremy Gibbons

  In Information Processing Letters. Vol. 79. No. 4. Pages 197–201. August, 2001.

  Details about The Generic Approximation Lemma | BibTeX data for The Generic Approximation Lemma | DOI (10.1016/S0020-0190(00)00220-9) | Link to The Generic Approximation Lemma

• [42]

  On the Semantics of Nested Datatypes

  Clare Martin and Jeremy Gibbons

  In Information Processing Letters. Vol. 80. No. 5. Pages 233–238. December, 2001.

  Details about On the Semantics of Nested Datatypes | BibTeX data for On the Semantics of Nested Datatypes | Link to On the Semantics of Nested Datatypes

• [43]

  When is a Function a Fold or an Unfold?

  Jeremy Gibbons‚ Graham Hutton and Thorsten Altenkirch

  In Electronic Notes in Theoretical Computer Science. Vol. 44. No. 1. April, 2001.

  Proceedings of Coalgebraic Methods in Computer Science

  Details about When is a Function a Fold or an Unfold? | BibTeX data for When is a Function a Fold or an Unfold? | DOI (10.1016/S1571-0661(04)80906-X) | Link to When is a Function a Fold or an Unfold?

• [44]

  Functional Pearl: Perfect trees and bit−reversal permutations

  Ralf Hinze

  In JFP. Vol. 10. No. 3. Pages 305−317. May, 2000.

  Details about Functional Pearl: Perfect trees and bit−reversal permutations | BibTeX data for Functional Pearl: Perfect trees and bit−reversal permutations | DOI (10.1017/S0956796800003701)

• [45]

  Generic Downwards Accumulations

  Jeremy Gibbons

  In Science of Computer Programming. Vol. 37. Pages 37–65. 2000.

  Details about Generic Downwards Accumulations | BibTeX data for Generic Downwards Accumulations | Link to Generic Downwards Accumulations

• [46]

  Functional Pearl: Explaining binomial heaps

  Ralf Hinze

  In JFP. Vol. 9. No. 1. Pages 93−104. January, 1999.

  Details about Functional Pearl: Explaining binomial heaps | BibTeX data for Functional Pearl: Explaining binomial heaps | DOI (10.1017/S0956796899003317)

• [47]

  Book review: “Purely Functional Data Structures”‚ by Chris Okasaki

  Ralf Hinze

  In JFP. Vol. 9. No. 5. Pages 577–578. September, 1999.

  Details about Book review: “Purely Functional Data Structures”‚ by Chris Okasaki | BibTeX data for Book review: “Purely Functional Data Structures”‚ by Chris Okasaki | DOI (doi: 10.1017/S0956796899009995)

• [48]

  de Bruijn Notation as a Nested Datatype

  Richard S. Bird and Ross Paterson

  In Journal of Functional Programming. Vol. 9. No. 1. Pages 77–91. 1999.

  Details about de Bruijn Notation as a Nested Datatype | BibTeX data for de Bruijn Notation as a Nested Datatype | DOI (10.1017/S0956796899003366) | Download (pdf) of de Bruijn Notation as a Nested Datatype

• [49]

  Generalised Folds for Nested Datatypes

  Richard Bird and Ross Paterson

  In Formal Aspects of Computing. Vol. 11. Pages 200–222. 1999.

  Details about Generalised Folds for Nested Datatypes | BibTeX data for Generalised Folds for Nested Datatypes | Download (pdf) of Generalised Folds for Nested Datatypes

• [50]

  Bridging the Algorithm Gap: A Linear−Time Functional Program for Paragraph Formatting

  Oege de Moor and Jeremy Gibbons

  In Science of Computer Programming. Vol. 35. No. 1. 1999.

  Details about Bridging the Algorithm Gap: A Linear−Time Functional Program for Paragraph Formatting | BibTeX data for Bridging the Algorithm Gap: A Linear−Time Functional Program for Paragraph Formatting | Link to Bridging the Algorithm Gap: A Linear−Time Functional Program for Paragraph Formatting

• [51]

  A Pointless Derivation of Radixsort

  Jeremy Gibbons

  In Journal of Functional Programming. Vol. 9. No. 3. Pages 339–346. 1999.

  Details about A Pointless Derivation of Radixsort | BibTeX data for A Pointless Derivation of Radixsort | Link to A Pointless Derivation of Radixsort

• [52]

  Meertens' Number

  Richard S. Bird

  In Journal of Functional Programming. Vol. 8. No. 1. Pages 83−88. 1998.

  Details about Meertens' Number | BibTeX data for Meertens' Number | DOI (10.1017/S0956796897002931)

• [53]

  Structured Programming in Java

  Jeremy Gibbons

  In SIGPLAN Notices. Vol. 33. No. 4. Pages 40–43. April, 1998.

  Also in Fintan Culwin‚ editor‚ Proceedings of the Second Conference on Java in the Computing Curriculum‚ South Bank University‚ London

  Details about Structured Programming in Java | BibTeX data for Structured Programming in Java | Link to Structured Programming in Java

• [54]

  On Merging and Selection

  Richard S. Bird

  In Journal of Functional Programming. Vol. 7. No. 3. Pages 349–354. 1997.

  Details about On Merging and Selection | BibTeX data for On Merging and Selection | DOI (10.1017/S0956796897002736)

• [55]

  On Building Trees with Minimum Height

  Richard S. Bird

  In Journal of Functional Programming. Vol. 7. No. 4. Pages 441–445. 1997.

  Details about On Building Trees with Minimum Height | BibTeX data for On Building Trees with Minimum Height | DOI (10.1017/S0956796897002803)

• [56]

  More Haste‚ Less Speed: Lazy Versus Eager Evaluation

  Richard S. Bird‚ Geraint Jones and Oege de Moor

  In Journal of Functional Programming. Vol. 7. No. 5. Pages 541–547. 1997.

  Details about More Haste‚ Less Speed: Lazy Versus Eager Evaluation | BibTeX data for More Haste‚ Less Speed: Lazy Versus Eager Evaluation | DOI (10.1017/S0956796897002827) | Download (pdf) of More Haste‚ Less Speed: Lazy Versus Eager Evaluation

• [57]

  On Computing Representatives

  Richard S. Bird and Jesús N. Ravelo

  In Information Processing Letters. Vol. 63. Pages 1–7. 1997.

  Details about On Computing Representatives | BibTeX data for On Computing Representatives | DOI (10.1016/S0020-0190(97)00087-2)

• [58]

  Functional Algorithm Design

  Richard S. Bird

  In Science of Computer Programming. Vol. 26. No. 1−3. Pages 15–31. 1996.

  Details about Functional Algorithm Design | BibTeX data for Functional Algorithm Design | DOI (10.1016/0167-6423(95)00033-X)

• [59]

  Generic Functional Programming with Types and Relations

  Richard Bird‚ Oege de Moor and Paul Hoogendijk

  In Journal of Functional Programming. Vol. 6. No. 1. Pages 1–28. 1996.

  Details about Generic Functional Programming with Types and Relations | BibTeX data for Generic Functional Programming with Types and Relations | Download (pdf) of Generic Functional Programming with Types and Relations

• [60]

  Computing Downwards Accumulations on Trees Quickly

  Jeremy Gibbons

  In Theoretical Computer Science. Vol. 169. No. 1. Pages 67–80. 1996.

  Earlier version appeared in Proceedings of the 16th Australian Computer Science Conference‚ Brisbane‚ 1993

  Details about Computing Downwards Accumulations on Trees Quickly | BibTeX data for Computing Downwards Accumulations on Trees Quickly | Link to Computing Downwards Accumulations on Trees Quickly

• [61]

  The Third Homomorphism Theorem

  Jeremy Gibbons

  In Journal of Functional Programming. Vol. 6. No. 4. Pages 657–665. 1996.

  Earlier version appeared in B. Jay‚C. editor‚ Computing: The Australian Theory Seminar‚ Sydney‚ December 1994‚ 62–6p.9

  Details about The Third Homomorphism Theorem | BibTeX data for The Third Homomorphism Theorem | Link to The Third Homomorphism Theorem

• [62]

  Deriving Tidy Drawings of Trees

  Jeremy Gibbons

  In Journal of Functional Programming. Vol. 6. No. 3. Pages 535–562. 1996.

  Details about Deriving Tidy Drawings of Trees | BibTeX data for Deriving Tidy Drawings of Trees | Link to Deriving Tidy Drawings of Trees

• [63]

  Efficient Parallel Algorithms for Tree Accumulations

  Jeremy Gibbons‚ Wentong Cai and David Skillicorn

  In Science of Computer Programming. Vol. 23. Pages 1–18. 1994.

  Details about Efficient Parallel Algorithms for Tree Accumulations | BibTeX data for Efficient Parallel Algorithms for Tree Accumulations | Link to Efficient Parallel Algorithms for Tree Accumulations

• [64]

  The Last Tail

  R. S. Bird

  In Journal of Functional Programming. Vol. 3. No. 1. Pages 117–122. 1993.

  Details about The Last Tail | BibTeX data for The Last Tail

• [65]

  List Partitions

  Richard S. Bird and Oege de Moor

  In Formal Aspects of Computing. Vol. 5. Pages 61–78. 1993.

  Details about List Partitions | BibTeX data for List Partitions | DOI (10.1007/BF01211316)

• [66]

  The Smallest Upravel

  Richard S. Bird

  In Science of Computer Programming. Vol. 18. Pages 281–292. 1992.

  Details about The Smallest Upravel | BibTeX data for The Smallest Upravel | DOI (10.1016/0167-6423(92)90020-C)

• [67]

  Unravelling Greedy Algorithms

  Richard S. Bird

  In Journal of Functional Programming. Vol. 2. No. 3. Pages 375–385. 1992.

  Details about Unravelling Greedy Algorithms | BibTeX data for Unravelling Greedy Algorithms

• [68]

  Two Greedy Algorithms

  Richard S. Bird

  In Journal of Functional Programming. Vol. 2. No. 2. Pages 237–244. 1992.

  Details about Two Greedy Algorithms | BibTeX data for Two Greedy Algorithms

• [69]

  The Minout Problem

  Richard S. Bird

  In Journal of Functional Programming. Vol. 1. No. 1. Pages 121–124. January, 1991.

  Details about The Minout Problem | BibTeX data for The Minout Problem

• [70]

  On Removing Duplicates

  Richard S. Bird

  In Journal of Functional Programming. Vol. 1. No. 2. Pages 235−243. 1991.

  Details about On Removing Duplicates | BibTeX data for On Removing Duplicates

• [71]

  Formal Derivation of a Pattern Matching Algorithm

  Richard S. Bird‚ Jeremy Gibbons and Geraint Jones

  In Science of Computer Programming. Vol. 12. No. 2. Pages 93–104. July, 1989.

  Details about Formal Derivation of a Pattern Matching Algorithm | BibTeX data for Formal Derivation of a Pattern Matching Algorithm | DOI (10.1016/0167-6423(89)90036-1)

• [72]

  Algebraic Identities for Program Calculation

  Richard S. Bird

  In Computer Journal. Vol. 32. No. 2. Pages 122–126. April, 1989.

  Details about Algebraic Identities for Program Calculation | BibTeX data for Algebraic Identities for Program Calculation | DOI (10.1093/comjnl/32.2.122)

• [73]

  Formal Derivation of a Pattern Matching Algorithm

  Richard S. Bird‚ Jeremy Gibbons and Geraint Jones

  In Science of Computer Programming. Vol. 12. No. 2. Pages 93–104. July, 1989.

  Details about Formal Derivation of a Pattern Matching Algorithm | BibTeX data for Formal Derivation of a Pattern Matching Algorithm | Link to Formal Derivation of a Pattern Matching Algorithm

• [74]

  A Formal Development of an Efficient Supercombinator Compiler

  R. S. Bird

  In Science of Computer Programming. Vol. 8. Pages 113–137. 1987.

  Details about A Formal Development of an Efficient Supercombinator Compiler | BibTeX data for A Formal Development of an Efficient Supercombinator Compiler | DOI (10.1016/0167-6423(87)90017-7)

• [75]

  The Alpha−Beta Algorithm: An Exercise in Program Transformation

  Richard S. Bird and John Hughes

  In Information Processing Letters. Vol. 24. No. 1. Pages 53–57. January, 1987.

  Details about The Alpha−Beta Algorithm: An Exercise in Program Transformation | BibTeX data for The Alpha−Beta Algorithm: An Exercise in Program Transformation | DOI (10.1016/0020-0190(87)90198-0)

• [76]

  Transformational Programming and the Paragraph Problem

  Richard S. Bird

  In Science of Computer Programming. Vol. 6. Pages 159–189. 1986.

  Details about Transformational Programming and the Paragraph Problem | BibTeX data for Transformational Programming and the Paragraph Problem | DOI (10.1016/0167-6423(86)90023-7)

• [77]

  Addendum to “The Promotion and Accumulation Strategies in Transformational Programming”

  Richard S. Bird

  In ACM Transactions on Programming Languages and Systems. Vol. 7. No. 3. Pages 490–492. July, 1985.

  Details about Addendum to “The Promotion and Accumulation Strategies in Transformational Programming” | BibTeX data for Addendum to “The Promotion and Accumulation Strategies in Transformational Programming”

• [78]

  Using Circular Programs to Eliminate Multiple Traversals of Data

  Richard S. Bird

  In Acta Informatica. Vol. 21. Pages 239–250. 1984.

  Details about Using Circular Programs to Eliminate Multiple Traversals of Data | BibTeX data for Using Circular Programs to Eliminate Multiple Traversals of Data | DOI (10.1007/BF00264249)

• [79]

  The Promotion and Accumulation Strategies in Transformational Programming

  Richard S. Bird

  In ACM Transactions on Programming Languages and Systems. Vol. 6. No. 4. Pages 487–504. October, 1984.

  See also Bird85:Promotion

  Details about The Promotion and Accumulation Strategies in Transformational Programming | BibTeX data for The Promotion and Accumulation Strategies in Transformational Programming | DOI (10.1145/1780.1781)

• [80]

  The Jogger's Problem

  Richard S. Bird

  In Information Processing Letters. Vol. 13. No. 3. Pages 114–117. 1981.

  Details about The Jogger's Problem | BibTeX data for The Jogger's Problem | DOI (10.1016/0020-0190(81)90122-8)

• [81]

  Surveyor's Forum: A Recurring Bug

  Richard S. Bird

  In ACM Computing Surveys. Vol. 13. No. 2. Pages 243. 1981.

  Details about Surveyor's Forum: A Recurring Bug | BibTeX data for Surveyor's Forum: A Recurring Bug | DOI (10.1145/356842.356848)

• [82]

  Tabulation Techniques for Recursive Programs

  Richard S. Bird

  In ACM Computing Surveys. Vol. 12. No. 4. Pages 403–417. December, 1980.

  See DBLP:journals/csur/Bird81

  Details about Tabulation Techniques for Recursive Programs | BibTeX data for Tabulation Techniques for Recursive Programs | DOI (10.1145/356827.356831)

• [83]

  Recursion Elimination with Variable Parameters

  Richard S. Bird

  In Computer Journal. Vol. 22. No. 2. Pages 151–154. 1979.

  Details about Recursion Elimination with Variable Parameters | BibTeX data for Recursion Elimination with Variable Parameters | DOI (10.1093/comjnl/22.2.151)

• [84]

  Two−Dimensional Pattern Matching

  Richard S. Bird

  In Information Processing Letters. Vol. 6. No. 5. Pages 168–170. 1977.

  Details about Two−Dimensional Pattern Matching | BibTeX data for Two−Dimensional Pattern Matching | DOI (10.1016/0020-0190(77)90017-5)

• [85]

  Notes on Recursion Elimination

  Richard S. Bird

  In Communications of the ACM. Vol. 20. No. 6. Pages 434–439. 1977.

  Details about Notes on Recursion Elimination | BibTeX data for Notes on Recursion Elimination | DOI (10.1145/359605.359630)

• [86]

  Improving Programs by the Introduction of Recursion

  Richard S. Bird

  In Communications of the ACM. Vol. 20. No. 11. Pages 856–863. November, 1977.

  Details about Improving Programs by the Introduction of Recursion | BibTeX data for Improving Programs by the Introduction of Recursion | DOI (10.1145/359863.359889)

• [87]

  Non Recursive Functionals

  Richard Bird

  In Zeitschrift für mathematische Logik und Grundlagen der Mathematik. Vol. 21. Pages 41–46. 1975.

  Details about Non Recursive Functionals | BibTeX data for Non Recursive Functionals | DOI (10.1002/malq.19750210105)

• [88]

  On Transformations of Programs

  Richard Bird

  In Journal of Computer and System Sciences. Vol. 8. Pages 22−35. 1974.

  Details about On Transformations of Programs | BibTeX data for On Transformations of Programs

• [89]

  Speeding Up Programs

  Richard S. Bird

  In Computer Journal. Vol. 17. No. 4. Pages 337–339. 1974.

  Details about Speeding Up Programs | BibTeX data for Speeding Up Programs

• [90]

  A Note on Definition by Cases

  Richard Bird

  In Zeitschrift für mathematische Logik und Grundlagen der Mathematik. Vol. 19. Pages 207–208. 1973.

  Details about A Note on Definition by Cases | BibTeX data for A Note on Definition by Cases | DOI (10.1002/malq.19730191304)

• [91]

  Integers with Given Initial Digits

  Richard Bird

  In American Mathematical Monthly. Vol. 79. Pages 367−370. 1972.

  Details about Integers with Given Initial Digits | BibTeX data for Integers with Given Initial Digits | DOI (10.2307/2978087) | Link to Integers with Given Initial Digits

Conference papers

• [1]

  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

• [2]

  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

• [3]

  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

• [4]

  Comprehending Ringads: For Phil Wadler‚ on the Occasion of his 60th Birthday

  Jeremy Gibbons

  In A List of Successes That Can Change the World. Vol. 9600 of LNCS. Pages 132−151. Springer. April, 2016.

  Details about Comprehending Ringads: For Phil Wadler‚ on the Occasion of his 60th Birthday | BibTeX data for Comprehending Ringads: For Phil Wadler‚ on the Occasion of his 60th Birthday | DOI (10.1007/978-3-319-30936-1_7) | Download (pdf) of Comprehending Ringads: For Phil Wadler‚ on the Occasion of his 60th Birthday

• [5]

  Reflections on Monadic Lenses

  Faris Abou−Saleh‚ James Cheney‚ Jeremy Gibbons‚ James McKinna and Perdita Stevens

  In A List of Successes That Can Change the World. Vol. 9600 of LNCS. Pages 1−31. Springer. April, 2016.

  Details about Reflections on Monadic Lenses | BibTeX data for Reflections on Monadic Lenses | DOI (10.1007/978-3-319-30936-1_1) | Download (pdf) of Reflections on Monadic Lenses

• [6]

  Notions of Bidirectional Computation and Entangled State Monads

  Faris Abou−Saleh‚ James Cheney‚ Jeremy Gibbons‚ James McKinna and Perdita Stevens

  In Mathematics of Program Construction. June, 2015.

  Details about Notions of Bidirectional Computation and Entangled State Monads | BibTeX data for Notions of Bidirectional Computation and Entangled State Monads | Download (pdf) of Notions of Bidirectional Computation and Entangled State Monads

• [7]

  Entangled State Monads

  James Cheney‚ James McKinna‚ Perdita Stevens‚ Jeremy Gibbons and Faris Abou−Saleh

  In BX Workshop. March, 2014.

  Details about Entangled State Monads | BibTeX data for Entangled State Monads | Download (pdf) of Entangled State Monads

• [8]

  Towards a Repository of BX Examples

  James Cheney‚ James McKinna‚ Perdita Stevens and Jeremy Gibbons

  In BX Workshop. March, 2014.

  Details about Towards a Repository of BX Examples | BibTeX data for Towards a Repository of BX Examples | Download (pdf) of Towards a Repository of BX Examples

• [9]

  Relational algebraic ornaments

  Hsiang−Shang Ko and Jeremy Gibbons

  In Dependently Typed Programming. ACM. 2013.

  Details about Relational algebraic ornaments | BibTeX data for Relational algebraic ornaments | DOI (10.1145/2502409.2502413) | Download (pdf) of Relational algebraic ornaments

• [10]

  Modularising inductive families

  Hsiang−Shang Ko and Jeremy Gibbons

  In Workshop on Generic Programming. Pages 13−24. ACM. 2011.

  Details about Modularising inductive families | BibTeX data for Modularising inductive families | DOI (10.1145/2036918.2036921) | Download (pdf) of Modularising inductive families

• [11]

  Gradual Refinement: Blending Pattern Matching with Data Abstraction

  Meng Wang‚ Jeremy Gibbons‚ Kazutaka Matsuda and Zhenjiang Hu

  In Jules Desharnais, editor, Mathematics of Program Construction. Vol. 6120 of LNCS. 2010.

  See revised journal version "Refactoring Pattern Matching"

  Details about Gradual Refinement: Blending Pattern Matching with Data Abstraction | BibTeX data for Gradual Refinement: Blending Pattern Matching with Data Abstraction | Download  (pdf) of Gradual Refinement: Blending Pattern Matching with Data Abstraction | DOI (10.1007/978-3-642-13321-3_22) | Download (pdf) of Gradual Refinement: Blending Pattern Matching with Data Abstraction

• [12]

  EffectiveAdvice: Disciplined Advice with Explicit Effects

  Tom Schrijvers Bruno C. d. S. Oliveira and William R. Cook

  In ACM SIG Proceedings of the 9th International Conference on Aspect−Oriented Software Development (AOSD). 2010.

  Details about EffectiveAdvice: Disciplined Advice with Explicit Effects | BibTeX data for EffectiveAdvice: Disciplined Advice with Explicit Effects

• [13]

  What Does Aspect−Oriented Programming Mean for Functional Programmers?

  Meng Wang and Bruno C. d. S. Oliveira

  In Patrik Jansson, editor, Proceedings of the ACM SIGPLAN Workshop on Generic Programming (WGP'09). ACM. August, 2009.

  Details about What Does Aspect−Oriented Programming Mean for Functional Programmers? | BibTeX data for What Does Aspect−Oriented Programming Mean for Functional Programmers? | Download  (pdf) of What Does Aspect−Oriented Programming Mean for Functional Programmers?

• [14]

  Creating transformations for matrix obfuscation

  Stephen Drape and Irina Voiculescu

  In Proceedings of SAS 2009. August, 2009.

  Details about Creating transformations for matrix obfuscation | BibTeX data for Creating transformations for matrix obfuscation | Download  (pdf) of Creating transformations for matrix obfuscation | DOI (10.1007/978-3-642-03237-0_19)

• [15]

  Modular Visitor Components: A Practical Solution to the Expression Families Problem

  Bruno C. d. S. Oliveira

  In Sophia Drossopoulou, editor, 23rd European Conference on Object Oriented Programming (ECOOP). July, 2009.

  Details about Modular Visitor Components: A Practical Solution to the Expression Families Problem | BibTeX data for Modular Visitor Components: A Practical Solution to the Expression Families Problem | Download  (pdf) of Modular Visitor Components: A Practical Solution to the Expression Families Problem

• [16]

  Translucent Abstraction: Safe Views through Invertible Programming (Extended version)

  Meng Wang‚ Jeremy Gibbons and Kazutaka Matsuda

  2009.

  Details about Translucent Abstraction: Safe Views through Invertible Programming (Extended version) | BibTeX data for Translucent Abstraction: Safe Views through Invertible Programming (Extended version) | Download  (pdf) of Translucent Abstraction: Safe Views through Invertible Programming (Extended version)

• [17]

  Parametric Datatype−Genericity

  Jeremy Gibbons and Ross Paterson

  In Workshop on Generic Programming. Edinburgh. August, 2009.

  Details about Parametric Datatype−Genericity | BibTeX data for Parametric Datatype−Genericity | DOI (10.1145/1596614.1596626) | Download (pdf) of Parametric Datatype−Genericity

• [18]

  Comparing Libraries for Generic Programming in Haskell

  Bruno C. d. S. Oliveira Alexey Rodriguez Johan Jeuring Patrik Jansson Alex Gerdes Oleg Kiselyov

  In Haskell Symposium. 2008.

  Details about Comparing Libraries for Generic Programming in Haskell | BibTeX data for Comparing Libraries for Generic Programming in Haskell

• [19]

  Zippy Tabulations of Recursive Functions

  Richard S. Bird

  In Philippe Audebaud and Christine Paulin−Mohring, editors, Mathematics of Program Construction. Vol. 5133 of Lecture Notes in Computer Science. Pages 92−109. Springer. 2008.

  Details about Zippy Tabulations of Recursive Functions | BibTeX data for Zippy Tabulations of Recursive Functions | DOI (10.1007/978-3-540-70594-9_7)

• [20]

  Unfolding Abstract Datatypes

  Jeremy Gibbons

  In Mathematics of Program Construction. July, 2008.

  Details about Unfolding Abstract Datatypes | BibTeX data for Unfolding Abstract Datatypes | DOI (10.1007/978-3-540-70594-9_8) | Download (pdf) of Unfolding Abstract Datatypes

• [21]

  The Visitor Pattern as a Reusable‚ Generic‚ Type−Safe Component

  Bruno C. d. S. Oliveira‚ Meng Wang and Jeremy Gibbons

  In Object−Oriented Programming: Systems‚ Languages‚ Applications (OOPSLA). 2008.

  Details about The Visitor Pattern as a Reusable‚ Generic‚ Type−Safe Component | BibTeX data for The Visitor Pattern as a Reusable‚ Generic‚ Type−Safe Component | DOI (10.1145/1449764.1449799) | Download (pdf) of The Visitor Pattern as a Reusable‚ Generic‚ Type−Safe Component

• [22]

  Scala for Generic Programmers

  Bruno Oliveira and Jeremy Gibbons

  In Ralf Hinze, editor, Workshop on Generic Programming. Victoria‚ BC. September, 2008.

  Details about Scala for Generic Programmers | BibTeX data for Scala for Generic Programmers | DOI (10.1145/1411318.1411323) | Download (pdf) of Scala for Generic Programmers

• [23]

  Specifying Imperative Data Obfuscations

  Stephen Drape‚ Clark Thomborson and Anirban Majumdar

  In Proceeding of the 10th Information Security Conference (ISC 07). Vol. 4779 of Lecture Notes in Computer Science. Pages 299–314. Springer. 2007.

  Details about Specifying Imperative Data Obfuscations | BibTeX data for Specifying Imperative Data Obfuscations | DOI (10.1007/978-3-540-75496-1_20)

• [24]

  Slicing Obfuscations: Design‚ Correctness and Evaluation

  Anirban Majumdar‚ Stephen Drape and Clark Thomborson

  In DRM '07: Proceedings of the 2007 ACM workshop on Digital Rights Management. Pages 70–81. ACM Press. 2007.

  Details about Slicing Obfuscations: Design‚ Correctness and Evaluation | BibTeX data for Slicing Obfuscations: Design‚ Correctness and Evaluation | DOI (/10.1145/1314276.1314290)

• [25]

  Metrics−based Evaluation of Slicing Obfuscations

  Anirban Majumdar‚ Stephen Drape and Clark Thomborson

  In Proceeding of the Third International Symposium on Information Assurance and Security. Pages 472–477. IEEE Computer Society. August, 2007.

  Details about Metrics−based Evaluation of Slicing Obfuscations | BibTeX data for Metrics−based Evaluation of Slicing Obfuscations | DOI (10.1109/IAS.2007.50)

• [26]

  Generic and Indexed Programming

  Jeremy Gibbons‚ Meng Wang and Bruno Cesar dos Santos Oliveira

  In Marco Morazan, editor, Trends in Functional Programming. 2007.

  Details about Generic and Indexed Programming | BibTeX data for Generic and Indexed Programming | Download (pdf) of Generic and Indexed Programming

• [27]

  Datatype−Generic Programming

  Jeremy Gibbons

  In Roland Backhouse‚ Jeremy Gibbons‚ Ralf Hinze and Johan Jeuring, editors, Spring School on Datatype−Generic Programming. Vol. 4719 of Lecture Notes in Computer Science. Springer−Verlag. 2007.

  Details about Datatype−Generic Programming | BibTeX data for Datatype−Generic Programming | Download (pdf) of Datatype−Generic Programming

• [28]

  Typed Contracts for Functional Programming

  Ralf Hinze‚ Johan Jeuring and Andres Löh

  In Masami Hagiya and Philip Wadler, editors, Proceedings of the Eighth International Symposium on Functional and Logic Programming (FLOPS 2006). Vol. 3945 of Lecture Notes in Computer Science. Pages 208−225. Springer Berlin / Heidelberg. April, 2006.

  Details about Typed Contracts for Functional Programming | BibTeX data for Typed Contracts for Functional Programming | DOI (10.1007/11737414\_15)

• [29]

  Open data types and open functions

  Andres Löh and Ralf Hinze

  In Michael Maher, editor, Proceedings of the 8th ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP '06). Pages 133−144. New York‚ NY‚ USA. July, 2006. ACM.

  Details about Open data types and open functions | BibTeX data for Open data types and open functions | DOI (10.1145/1140335.1140352)

• [30]

  Generics as a Library

  Bruno C. d. S. Oliveira‚ Ralf Hinze and Andres Löh

  In Henrik Nilsson, editor, Proceedings of the Seventh Symposium on Trends in Functional Programming (TFP '06). Intellect. 2006.

  Details about Generics as a Library | BibTeX data for Generics as a Library | Link to Generics as a Library

• [31]

  “Scrap Your Boilerplate” Revolutions

  Ralf Hinze and Andres Löh

  In Tarmo Uustalu, editor, 8th International Conference on Mathematics of Program Construction (MPC '06). Vol. 4014 of Lecture Notes in Computer Science. Pages 180−208. Springer Berlin / Heidelberg. July, 2006.

  Details about “Scrap Your Boilerplate” Revolutions | BibTeX data for “Scrap Your Boilerplate” Revolutions | DOI (10.1007/11783596\_13)

• [32]

  “Scrap Your Boilerplate” Reloaded

  Ralf Hinze‚ Andres Löh and Bruno C.d.S. Oliveira

  In Masami Hagiya and Philip Wadler, editors, Proceedings of the Eighth International Symposium on Functional and Logic Programming (FLOPS 2006). Vol. 3945 of Lecture Notes in Computer Science. Pages 13−29. Springer Berlin / Heidelberg. April, 2006.

  Details about “Scrap Your Boilerplate” Reloaded | BibTeX data for “Scrap Your Boilerplate” Reloaded | DOI (10.1007/11737414\_3)

• [33]

  Loopless Functional Algorithms

  Richard S. Bird

  In Tarmo Uustalu, editor, Mathematics of Program Construction. Vol. 4014 of Lecture Notes in Computer Science. Pages 90−114. Springer. 2006.

  Details about Loopless Functional Algorithms | BibTeX data for Loopless Functional Algorithms | DOI (10.1007/11783596_9)

• [34]

  Improving Saddleback Search: A Lesson in Algorithm Design

  Richard S. Bird

  In Tarmo Uustalu, editor, Mathematics of Program Construction. Vol. 4014 of Lecture Notes in Computer Science. Pages 82−89. Springer. 2006.

  Details about Improving Saddleback Search: A Lesson in Algorithm Design | BibTeX data for Improving Saddleback Search: A Lesson in Algorithm Design | DOI (10.1007/11783596_8)

• [35]

  Fifteen Years of Functional Pearls

  Richard S. Bird

  In John H. Reppy and Julia L. Lawall, editors, International Conference on Functional Programming. Pages 215. 2006.

  Details about Fifteen Years of Functional Pearls | BibTeX data for Fifteen Years of Functional Pearls | DOI (10.1145/1159803.1159832)

• [36]

  The Essence of the Iterator Pattern

  Jeremy Gibbons and Bruno César dos Santos Oliveira

  In Conor McBride and Tarmo Uustalu, editors, Mathematically−Structured Functional Programming. 2006.

  Superseded by Gibbons&Oliveira2008:Essence

  Details about The Essence of the Iterator Pattern | BibTeX data for The Essence of the Iterator Pattern | Download (pdf) of The Essence of the Iterator Pattern

• [37]

  Fission for Program Comprehension

  Jeremy Gibbons

  In Tarmo Uustalu, editor, Mathematics of Program Construction. Vol. 4014 of Lecture Notes in Computer Science. Pages 162−179. Springer−Verlag. 2006.

  Details about Fission for Program Comprehension | BibTeX data for Fission for Program Comprehension | DOI (10.1007/11783596_12) | Download (pdf) of Fission for Program Comprehension

• [38]

  Fast and Loose Reasoning is Morally Correct

  Nils Anders Danielsson‚ Jeremy Gibbons‚ John Hughes and Patrik Jansson

  In Principles of Programming Languages. Pages 206−217. January, 2006.

  Details about Fast and Loose Reasoning is Morally Correct | BibTeX data for Fast and Loose Reasoning is Morally Correct | DOI (10.1145/1111037.1111056) | Download (pdf) of Fast and Loose Reasoning is Morally Correct

• [39]

  Design Patterns as Higher−Order Datatype−Generic Programs

  Jeremy Gibbons

  In Ralf Hinze, editor, Workshop on Generic Programming. September, 2006.

  Details about Design Patterns as Higher−Order Datatype−Generic Programs | BibTeX data for Design Patterns as Higher−Order Datatype−Generic Programs | Download (pdf) of Design Patterns as Higher−Order Datatype−Generic Programs

• [40]

  Polymorphic String Matching

  Richard S. Bird

  In Haskell Workshop. Pages 110–115. New York‚ NY‚ USA. 2005. ACM Press.

  Details about Polymorphic String Matching | BibTeX data for Polymorphic String Matching | DOI (10.1145/1088348.1088359)

• [41]

  TypeCase: A Design Pattern for Type−Indexed Functions

  Bruno César dos Santos Oliveira and Jeremy Gibbons

  In Daan Leijen, editor, Haskell Workshop. Pages 98−109. 2005.

  Details about TypeCase: A Design Pattern for Type−Indexed Functions | BibTeX data for TypeCase: A Design Pattern for Type−Indexed Functions | DOI (10.1145/1088348.1088358) | Download (pdf) of TypeCase: A Design Pattern for Type−Indexed Functions

• [42]

  Design Patterns as Higher−Order Datatype−Generic Programs

  Jeremy Gibbons

  In Object−Oriented Programming: Systems‚ Languages‚ Applications. San Diego. October, 2005.

  A revision of Gibbons2005:DesignECOOP

  Details about Design Patterns as Higher−Order Datatype−Generic Programs | BibTeX data for Design Patterns as Higher−Order Datatype−Generic Programs | Link to Design Patterns as Higher−Order Datatype−Generic Programs

• [43]

  Design Patterns as Higher−Order Datatype−Generic Programs

  Jeremy Gibbons

  In European Conference on Object−Oriented Programming. Glasgow. July, 2005.

  Later version appears as Gibbons2005:DesignOOPSLA

  Details about Design Patterns as Higher−Order Datatype−Generic Programs | BibTeX data for Design Patterns as Higher−Order Datatype−Generic Programs | Link to Design Patterns as Higher−Order Datatype−Generic Programs

• [44]

  Streaming Representation−Changers

  Jeremy Gibbons

  In Dexter Kozen, editor, Mathematics of Program Construction. Vol. 3125 of Lecture Notes in Computer Science. Pages 142−168. July, 2004.

  http://www.springerlink.com/index/LHQ73WU5GU686976

  Details about Streaming Representation−Changers | BibTeX data for Streaming Representation−Changers | DOI (10.1007/978-3-540-27764-4_9) | Download (pdf) of Streaming Representation−Changers

• [45]

  Trouble Shared is Trouble Halved

  Richard Bird and Ralf Hinze

  In Haskell Workshop. Pages 1–6. New York‚ NY‚ USA. 2003. ACM Press.

  Details about Trouble Shared is Trouble Halved | BibTeX data for Trouble Shared is Trouble Halved | DOI (10.1145/871895.871896)

• [46]

  Rebuilding a Tree from Its Traversals: A Case Study of Program Inversion

  Shin−Cheng Mu and Richard S. Bird

  In Atsushi Ohori, editor, Asian Symposium on Programming Languages and Systems. Vol. 2895 of Lecture Notes in Computer Science. Pages 265−282. Springer. 2003.

  Details about Rebuilding a Tree from Its Traversals: A Case Study of Program Inversion | BibTeX data for Rebuilding a Tree from Its Traversals: A Case Study of Program Inversion | Download (pdf) of Rebuilding a Tree from Its Traversals: A Case Study of Program Inversion

• [47]

  Arithmetic Coding with Folds and Unfolds

  Richard Bird and Jeremy Gibbons

  In Johan Jeuring and Simon Peyton Jones, editors, Advanced Functional Programming 4. Vol. 2638 of Lecture Notes in Computer Science. Pages 1−26. Springer−Verlag. 2003.

  Details about Arithmetic Coding with Folds and Unfolds | BibTeX data for Arithmetic Coding with Folds and Unfolds | Download (pdf) of Arithmetic Coding with Folds and Unfolds

• [48]

  Patterns in Datatype−Generic Programming

  Jeremy Gibbons

  In Jörg Striegnitz and Kei Davis, editors, Multiparadigm Programming. Vol. 27. Pages 277−289. John von Neumann Institute for Computing (NIC). 2003.

  First International Workshop on Declarative Programming in the Context of Object−Oriented Languages (DPCOOL)

  Details about Patterns in Datatype−Generic Programming | BibTeX data for Patterns in Datatype−Generic Programming | Download (pdf) of Patterns in Datatype−Generic Programming

• [49]

  Arithmetic Coding with Folds and Unfolds

  Richard Bird and Jeremy Gibbons

  In Johan Jeuring and Simon Peyton Jones, editors, Advanced Functional Programming 4. Vol. 2638 of Lecture Notes in Computer Science. Pages 1−26. Springer−Verlag. 2003.

  Code available at http://www.cs.ox.ac.uk/people/jeremy.gibbons/publications/arith.zip

  Details about Arithmetic Coding with Folds and Unfolds | BibTeX data for Arithmetic Coding with Folds and Unfolds | DOI (10.1007/978-3-540-44833-4_1) | Download (pdf) of Arithmetic Coding with Folds and Unfolds

• [50]

  Transforming the .NET Intermediate Language Using Path Logic Programming

  Stephen Drape‚ Oege de Moor and Ganesh Sittampalam

  In Principles and Practice of Declarative Programming. Pages 133–144. ACM Press. 2002.

  Details about Transforming the .NET Intermediate Language Using Path Logic Programming | BibTeX data for Transforming the .NET Intermediate Language Using Path Logic Programming

• [51]

  Type−indexed Data Types

  Ralf Hinze‚ Johan Jeuring and Andres Löh

  In Eerke A. Boiten and Bernhard Möller, editors, Proceedings of the Sixth International Conference on Mathematics of Program Construction (MPC '02). Vol. 2386 of Lecture Notes in Computer Science. Pages 148–174. Springer Berlin / Heidelberg. July, 2002.

  Details about Type−indexed Data Types | BibTeX data for Type−indexed Data Types | DOI (10.1007/3-540-45442-X\_10)

• [52]

  Inverting Functions as Folds

  Shin−Cheng Mu and Richard S. Bird

  In Eerke A. Boiten and Bernhard Möller, editors, Mathematics of Program Construction. Vol. 2386 of Lecture Notes in Computer Science. Pages 209−232. Springer. 2002.

  Details about Inverting Functions as Folds | BibTeX data for Inverting Functions as Folds | Download (pdf) of Inverting Functions as Folds

• [53]

  Towards a Colimit−Based Semantics for Visual Programming

  Jeremy Gibbons

  In Coordination Models and Languages. Vol. 2315 of Lecture Notes in Computer Science. Pages 166–173. April, 2002.

  Details about Towards a Colimit−Based Semantics for Visual Programming | BibTeX data for Towards a Colimit−Based Semantics for Visual Programming | Download (pdf) of Towards a Colimit−Based Semantics for Visual Programming

• [54]

  Derivable Type Classes

  Ralf Hinze and Simon Peyton Jones

  In Graham Hutton, editor, Proceedings of the 2000 ACM SIGPLAN Haskell Workshop. Vol. 41(1) of Electronic Notes in Theoretical Computer Science. Pages 5−35. Elsevier Science. August, 2001.

  The preliminary proceedings appeared as a University of Nottingham technical report

  Details about Derivable Type Classes | BibTeX data for Derivable Type Classes | DOI (10.1016/S1571-0661(05)80542-0)

• [55]

  Functional Quantum Programming

  Shin−Cheng Mu and Richard Bird

  In Asian Workshop on Programming Languages and Systems. KAIST‚ Dajeaon‚ Korea. December, 2001.

  Details about Functional Quantum Programming | BibTeX data for Functional Quantum Programming | Download (pdf) of Functional Quantum Programming

• [56]

  Program Optimisation‚ Naturally

  Richard Bird‚ Jeremy Gibbons and Geraint Jones

  In J. W. Davies‚ A. W. Roscoe and J. C. P. Woodcock, editors, Millenial Perspectives in Computer Science. Palgrave. 2000.

  Details about Program Optimisation‚ Naturally | BibTeX data for Program Optimisation‚ Naturally | Link to Program Optimisation‚ Naturally

• [57]

  On Building Trees with Minimum Height‚ Relationally

  Shin−Cheng Mu and Richard Bird

  In First Asian Workshop on Programming Languages and Systems. 2000.

  Details about On Building Trees with Minimum Height‚ Relationally | BibTeX data for On Building Trees with Minimum Height‚ Relationally | Download (pdf) of On Building Trees with Minimum Height‚ Relationally

• [58]

  Program Optimisation‚ Naturally

  Richard Bird‚ Jeremy Gibbons and Geraint Jones

  In J. W. Davies‚ A. W. Roscoe and J. C. P. Woodcock, editors, Millenial Perspectives in Computer Science. Palgrave. 2000.

  Details about Program Optimisation‚ Naturally | BibTeX data for Program Optimisation‚ Naturally | Link to Program Optimisation‚ Naturally

• [59]

  Pointwise Relational Programming

  Oege de Moor and Jeremy Gibbons

  In Algebraic Methodology and Software Technology. Vol. 1816 of Lecture Notes in Computer Science. Pages 371–390. May, 2000.

  Details about Pointwise Relational Programming | BibTeX data for Pointwise Relational Programming | Link to Pointwise Relational Programming

• [60]

  Straight to the Heart of Computer Science via Functional Programming

  Robert Giegerich‚ Ralf Hinze and Stefan Kurtz

  In Matthias Felleisen‚ Michael Hanus and Simon Thompson, editors, Proceedings of the Workshop on Functional and Declarative Programming in Education‚ FDPE'99‚ Paris‚ France. Pages 1–5. September, 1999.

  The proceedings appeared as a technical report of Rice University‚ Rice COMP TR99−346

  Details about Straight to the Heart of Computer Science via Functional Programming | BibTeX data for Straight to the Heart of Computer Science via Functional Programming

• [61]

  Manufacturing Datatypes

  Ralf Hinze

  In Chris Okasaki, editor, Proceedings of the Workshop on Algorithmic Aspects of Advanced Programming Languages (WAAAPL '99). Pages 1–16. September, 1999.

  The proceedings appeared as a technical report of Columbia University‚ CUCS−023−99‚ also available from http://www.cs.columbia.edu/ cdo/waaapl.html

  Details about Manufacturing Datatypes | BibTeX data for Manufacturing Datatypes

• [62]

  Constructing Red−Black Trees

  Ralf Hinze

  In Chris Okasaki, editor, Proceedings of the Workshop on Algorithmic Aspects of Advanced Programming Languages (WAAAPL' 99). Pages 89–99. September, 1999.

  The proceedings appeared as a technical report of Columbia University‚ CUCS−023−99

  Details about Constructing Red−Black Trees | BibTeX data for Constructing Red−Black Trees

• [63]

  A Generic Programming Extension for Haskell

  Ralf Hinze

  In Erik Meijer, editor, Proceedings of the 3rd Haskell Workshop‚ Paris‚ France. September, 1999.

  The proceedings appeared as a technical report of Universiteit Utrecht‚ UU−CS−1999−28

  Details about A Generic Programming Extension for Haskell | BibTeX data for A Generic Programming Extension for Haskell

• [64]

  Proof Methods for Structured Corecursive Programs

  Jeremy Gibbons and Graham Hutton

  In Proceedings of 1st Scottish Workshop on Functional Programming. 1999.

  Details about Proof Methods for Structured Corecursive Programs | BibTeX data for Proof Methods for Structured Corecursive Programs

• [65]

  Prological Features in a Functional Setting — Axioms and Implementations

  Ralf Hinze

  In Masahiko Sato and Yoshihito Toyama, editors, Proceedings of the Third Fuji International Symposium on Functional and Logic Programming (FLOPS '98). Pages 98–122. Singapore‚ New Jersey‚ London‚ Hong Kong. April, 1998. World Scientific.

  Details about Prological Features in a Functional Setting — Axioms and Implementations | BibTeX data for Prological Features in a Functional Setting — Axioms and Implementations

• [66]

  Nested Datatypes

  Richard S. Bird and Lambert Meertens

  In Johan Jeuring, editor, LNCS 1422: Proceedings of Mathematics of Program Construction. Pages 52–67. Marstrand‚ Sweden. June, 1998. Springer−Verlag.

  Details about Nested Datatypes | BibTeX data for Nested Datatypes | Download (pdf) of Nested Datatypes

• [67]

  The Under−Appreciated Unfold

  Jeremy Gibbons and Geraint Jones

  In International Conference on Functional Programming. Pages 273–279. Baltimore‚ Maryland. September, 1998.

  Details about The Under−Appreciated Unfold | BibTeX data for The Under−Appreciated Unfold | Link to The Under−Appreciated Unfold

• [68]

  Polytypic Downwards Accumulations

  Jeremy Gibbons

  In Johan Jeuring, editor, Proceedings of Mathematics of Program Construction. Vol. 1422 of Lecture Notes in Computer Science. Pages 207−233. Marstrand‚ Sweden. June, 1998. Springer−Verlag.

  Details about Polytypic Downwards Accumulations | BibTeX data for Polytypic Downwards Accumulations | Link to Polytypic Downwards Accumulations

• [69]

  Allegories as a Basis for Algorithmics

  Richard S. Bird

  In Eugenio Moggi and Guiseppe Rosolini, editors, LNCS 1290: Category Theory and Computer Science. Pages 34–46. Springer−Verlag. September, 1997.

  Details about Allegories as a Basis for Algorithmics | BibTeX data for Allegories as a Basis for Algorithmics | DOI (10.1007/BFb0026979)

• [70]

  Calculating Functional Programs

  Jeremy Gibbons

  In Keiichi Nakata, editor, Proceedings of ISRG/SERG Research Colloquium. School of Computing and Mathematical Sciences‚ Oxford Brookes University. November, 1997.

  Technical Report CMS−TR−98−01

  Details about Calculating Functional Programs | BibTeX data for Calculating Functional Programs | Link to Calculating Functional Programs

• [71]

  Tracing Lazy Functional Languages

  Jeremy Gibbons and Keith Wansbrough

  In Michael E. Houle and Peter Eades, editors, Computing: The Australasian Theory Seminar. Pages 11–20. Melbourne. January, 1996.

  Details about Tracing Lazy Functional Languages | BibTeX data for Tracing Lazy Functional Languages | Link to Tracing Lazy Functional Languages

• [72]

  Functional Algorithm Design

  Richard S. Bird

  In Mathematics of Program Construction. Vol. 947 of Lecture Notes in Computer Science. Pages 2−17. Springer. 1995.

  Details about Functional Algorithm Design | BibTeX data for Functional Algorithm Design | DOI (10.1007/3-540-60117-1_2)

• [73]

  An Initial−Algebra Approach to Directed Acyclic Graphs

  Jeremy Gibbons

  In Bernhard Möller, editor, Mathematics of Program Construction. Vol. 947 of Lecture Notes in Computer Science. Pages 282–303. Springer−Verlag. 1995.

  Details about An Initial−Algebra Approach to Directed Acyclic Graphs | BibTeX data for An Initial−Algebra Approach to Directed Acyclic Graphs | Link to An Initial−Algebra Approach to Directed Acyclic Graphs

• [74]

  How to Derive Tidy Drawings of Trees

  Jeremy Gibbons

  In C. Calude‚ M. J. J. Lennon and H. Maurer, editors, Proceedings of Salodays in Auckland. Pages 53–73. Department of Computer Science‚ University of Auckland. 1994.

  Also in Proceedings of First New Zealand Formal Program Development Colloquium‚ 105–126p‥

  Details about How to Derive Tidy Drawings of Trees | BibTeX data for How to Derive Tidy Drawings of Trees | Link to How to Derive Tidy Drawings of Trees

• [75]

  An Introduction to the Bird−Meertens Formalism

  Jeremy Gibbons

  In Steve Reeves, editor, Proceedings of the First New Zealand Formal Program Development Colloquium. Pages 1–12. Hamilton. November, 1994.

  Details about An Introduction to the Bird−Meertens Formalism | BibTeX data for An Introduction to the Bird−Meertens Formalism | Link to An Introduction to the Bird−Meertens Formalism

• [76]

  Solving Optimisation Problems with Catamorphisms

  Richard S. Bird and Oege de Moor

  In Mathematics of Program Construction. Vol. 669 of Lecture Notes in Computer Science. Pages 45–66. Springer. 1993.

  Details about Solving Optimisation Problems with Catamorphisms | BibTeX data for Solving Optimisation Problems with Catamorphisms | DOI (10.1007/3-540-56625-2_7) | Download (pdf) of Solving Optimisation Problems with Catamorphisms

• [77]

  From Dynamic Programming to Greedy Algorithms

  Richard S. Bird and Oege de Moor

  In Bernhard Möller‚ Helmut Partsch and Steve Schumann, editors, IFIP TC2/WG2.1 State−of−the−Art Report on Formal Program Development. Vol. 755 of Lecture Notes in Computer Science. Springer−Verlag. 1993.

  Details about From Dynamic Programming to Greedy Algorithms | BibTeX data for From Dynamic Programming to Greedy Algorithms | DOI (10.1007/3-540-57499-9_16) | Download (pdf) of From Dynamic Programming to Greedy Algorithms

• [78]

  Upwards and Downwards Accumulations on Trees

  Jeremy Gibbons

  In R. S. Bird‚ C. C. Morgan and J. C. P. Woodcock, editors, Mathematics of Program Construction. Vol. 669 of Lecture Notes in Computer Science. Pages 122–138. Springer−Verlag. 1993.

  A revised version appears in the Proceedings of the Massey Functional Programming Workshop‚ 1992

  Details about Upwards and Downwards Accumulations on Trees | BibTeX data for Upwards and Downwards Accumulations on Trees | Link to Upwards and Downwards Accumulations on Trees

• [79]

  Computing Downwards Accumulations on Trees Quickly

  Jeremy Gibbons

  In Gopal Gupta‚ George Mohay and Rodney Topor, editors, 16th Australian Computer Science Conference. Pages 685–691. Brisbane. February, 1993.

  Details about Computing Downwards Accumulations on Trees Quickly | BibTeX data for Computing Downwards Accumulations on Trees Quickly

• [80]

  Knuth's Problem

  Richard S. Bird

  In B. Möller, editor, IFIP TC2/WG2.1 Working Conference on Constructing Programs from Specifications. Pages 1–8. North−Holland. 1991.

  Details about Knuth's Problem | BibTeX data for Knuth's Problem

• [81]

  Lectures on Constructive Functional Programming

  Richard S. Bird

  In Manfred Broy, editor, Constructive Methods in Computer Science. Pages 151–218. Springer−Verlag. 1988.

  NATO ASI Series F Volume 55. Also available as Technical Monograph PRG−69‚ from the Programming Research Group‚ Oxford University

  Details about Lectures on Constructive Functional Programming | BibTeX data for Lectures on Constructive Functional Programming

Technical reports

• [1]

  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

• [2]

  Intellectual Property Protection using Obfuscation

  Stephen Drape

  No. RR−10−02. March, 2010.

  Details about Intellectual Property Protection using Obfuscation | BibTeX data for Intellectual Property Protection using Obfuscation | Download  (pdf) of Intellectual Property Protection using Obfuscation

• [3]

  The Use of Matrices in Obfuscation

  Stephen Drape and Irina Voiculescu

  No. RR−08−12. Oxford University Computing Laboratory. December, 2008.

  Details about The Use of Matrices in Obfuscation | BibTeX data for The Use of Matrices in Obfuscation | Download  (pdf) of The Use of Matrices in Obfuscation

• [4]

  The Suitability of Different Binary Tree Obfuscations

  Stephen Drape

  No. 310. CDMTCS‚ The University of Auckland. Auckland‚ New Zealand. June, 2007.

  Details about The Suitability of Different Binary Tree Obfuscations | BibTeX data for The Suitability of Different Binary Tree Obfuscations | Download  (pdf) of The Suitability of Different Binary Tree Obfuscations

• [5]

  Design and Evaluation of Slicing Obfuscations

  Stephen Drape and Anirban Majumdar

  No. 311. CDMTCS‚ The University of Auckland. Auckland‚ New Zealand. June, 2007.

  Details about Design and Evaluation of Slicing Obfuscations | BibTeX data for Design and Evaluation of Slicing Obfuscations | Download  (pdf) of Design and Evaluation of Slicing Obfuscations

• [6]

  Open data types and open functions

  Ralf Hinze and Andres Löh

  No. IAI−TR−2006−3. Institut für Informatik III‚ Universität Bonn. February, 2006.

  Details about Open data types and open functions | BibTeX data for Open data types and open functions

• [7]

  “Scrap Your Boilerplate” Reloaded

  Ralf Hinze‚ Andres Löh and Bruno C.d.S. Oliveira

  No. IAI−TR−2006−2. Institut für Informatik III‚ Universität Bonn. January, 2006.

  Details about “Scrap Your Boilerplate” Reloaded | BibTeX data for “Scrap Your Boilerplate” Reloaded

• [8]

  Using Haskell to Model Tree Obfuscations

  Stephen Drape

  No. RR−04−17. Oxford University Computing Laboratory. July, 2004.

  Details about Using Haskell to Model Tree Obfuscations | BibTeX data for Using Haskell to Model Tree Obfuscations | Download  (ps) of Using Haskell to Model Tree Obfuscations

• [9]

  The Matrix Obfuscated

  Stephen Drape

  No. RR−04−12. Oxford University Computing Laboratory. June, 2004.

  Details about The Matrix Obfuscated | BibTeX data for The Matrix Obfuscated | Download  (ps) of The Matrix Obfuscated

• [10]

  Obfuscating Set Representations

  Stephen Drape

  No. RR−04−09. Oxford University Computing Laboratory. May, 2004.

  Details about Obfuscating Set Representations | BibTeX data for Obfuscating Set Representations | Download  (ps) of Obfuscating Set Representations

• [11]

  First−Class Phantom Types

  James Cheney and Ralf Hinze

  Cornell University. 2003.

  Details about First−Class Phantom Types | BibTeX data for First−Class Phantom Types

• [12]

  Type−indexed data types

  Ralf Hinze‚ Johan Jeuring and Andres Löh

  No. UU−CS−2002−11. Universiteit Utrecht. 2002.

  Details about Type−indexed data types | BibTeX data for Type−indexed data types

• [13]

  Constructing tournament representations: An exercise in pointwise relational programming

  Ralf Hinze

  No. IAI−TR−2002−2. Institut für Informatik III‚ Universität Bonn. February, 2002.

  Details about Constructing tournament representations: An exercise in pointwise relational programming | BibTeX data for Constructing tournament representations: An exercise in pointwise relational programming

• [14]

  Combining Generics and Dynamics

  Peter Achten and Ralf Hinze

  No. NIII−R0206. Nijmegen Institute for Computing and Information Sciences‚ University of Nijmegen. July, 2002.

  Details about Combining Generics and Dynamics | BibTeX data for Combining Generics and Dynamics

• [15]

  Church numerals‚ twice!

  Ralf Hinze

  No. IAI−TR−2002−3. Institut für Informatik III‚ Universität Bonn. February, 2002.

  Details about Church numerals‚ twice! | BibTeX data for Church numerals‚ twice!

• [16]

  A Simple Implementation Technique for Priority Search Queues

  Ralf Hinze

  No. UU−CS−2001−09. Universiteit Utrecht. March, 2001.

  Details about A Simple Implementation Technique for Priority Search Queues | BibTeX data for A Simple Implementation Technique for Priority Search Queues

• [17]

  Polytypic values possess polykinded types

  Ralf Hinze

  No. IAI−TR−99−15. Institut für Informatik III‚ Universität Bonn. December, 1999.

  Details about Polytypic values possess polykinded types | BibTeX data for Polytypic values possess polykinded types

• [18]

  Polytypic Programming With Ease

  Ralf Hinze

  No. IAI−TR−99−2. Institut für Informatik III‚ Universität Bonn. February, 1999.

  Details about Polytypic Programming With Ease | BibTeX data for Polytypic Programming With Ease

• [19]

  Perfect Trees and Bit−reversal Permutations

  Ralf Hinze

  No. IAI−TR−99−4. Institut für Informatik III‚ Universität Bonn. March, 1999.

  Details about Perfect Trees and Bit−reversal Permutations | BibTeX data for Perfect Trees and Bit−reversal Permutations

• [20]

  Manufacturing Datatypes

  Ralf Hinze

  No. IAI−TR−99−5. Institut für Informatik III‚ Universität Bonn. April, 1999.

  Details about Manufacturing Datatypes | BibTeX data for Manufacturing Datatypes

• [21]

  Efficient Generalized Folds

  Ralf Hinze

  No. IAI−TR−99−8. Institut für Informatik III‚ Universität Bonn. June, 1999.

  Details about Efficient Generalized Folds | BibTeX data for Efficient Generalized Folds

• [22]

  Deriving monad transformers

  Ralf Hinze

  No. IAI−TR−99−1. Institut für Informatik III‚ Universität Bonn. January, 1999.

  Details about Deriving monad transformers | BibTeX data for Deriving monad transformers

• [23]

  Constructing Red−Black Trees

  Ralf Hinze

  No. IAI−TR−99−6. Institut für Informatik III‚ Universität Bonn. May, 1999.

  Details about Constructing Red−Black Trees | BibTeX data for Constructing Red−Black Trees

• [24]

  A New Approach to Generic Functional Programming

  Ralf Hinze

  No. IAI−TR−99−9. Institut für Informatik III‚ Universität Bonn. July, 1999.

  Details about A New Approach to Generic Functional Programming | BibTeX data for A New Approach to Generic Functional Programming

• [25]

  Polytypic Functions Over Nested Datatypes

  Ralf Hinze

  No. IAI−TR−98−10. Institut für Informatik III‚ Universität Bonn. October, 1998.

  Details about Polytypic Functions Over Nested Datatypes | BibTeX data for Polytypic Functions Over Nested Datatypes

• [26]

  Numerical Representations as Higher−Order Nested Datatypes

  Ralf Hinze

  No. IAI−TR−98−12. Institut für Informatik III‚ Universität Bonn. December, 1998.

  Details about Numerical Representations as Higher−Order Nested Datatypes | BibTeX data for Numerical Representations as Higher−Order Nested Datatypes

• [27]

  Generalizing Generalized Tries

  Ralf Hinze

  No. IAI−TR−98−11. Institut für Informatik III‚ Universität Bonn. November, 1998.

  Details about Generalizing Generalized Tries | BibTeX data for Generalizing Generalized Tries

• [28]

  More on Merging and Selection

  Jeremy Gibbons

  No. CMS−TR−97−08. School of Computing and Mathematical Sciences‚ Oxford Brookes University. October, 1997.

  Details about More on Merging and Selection | BibTeX data for More on Merging and Selection | Link to More on Merging and Selection

• [29]

  Conditionals in Distributive Categories

  Jeremy Gibbons

  No. CMS−TR−97−01. School of Computing and Mathematical Sciences‚ Oxford Brookes University. January, 1997.

  Details about Conditionals in Distributive Categories | BibTeX data for Conditionals in Distributive Categories | Link to Conditionals in Distributive Categories

• [30]

  Efficient Monadic−style Backtracking

  Ralf Hinze

  No. IAI−TR−96−9. Institut für Informatik III‚ Universität Bonn. October, 1996.

  Details about Efficient Monadic−style Backtracking | BibTeX data for Efficient Monadic−style Backtracking

• [31]

  Linear−time Breadth−first Tree Algorithms: An Exercise in the Arithmetic of Folds and Zips

  Geraint Jones and Jeremy Gibbons

  No. 7No.1. Dept of Computer Science‚ University of Auckland. May, 1993.

  Also IFIP Working Group 2.1 working paper 705 WIN−2

  Details about Linear−time Breadth−first Tree Algorithms: An Exercise in the Arithmetic of Folds and Zips | BibTeX data for Linear−time Breadth−first Tree Algorithms: An Exercise in the Arithmetic of Folds and Zips | Link to Linear−time Breadth−first Tree Algorithms: An Exercise in the Arithmetic of Folds and Zips

• [32]

  The Categorical Abstract Machine: Basics and Enhancments

  Ralf Hinze

  No. IAI−TR−92−1. Institut für Informatik III‚ Universität Bonn. December, 1992.

  Details about The Categorical Abstract Machine: Basics and Enhancments | BibTeX data for The Categorical Abstract Machine: Basics and Enhancments

Theses

• [1]

  Cost semantics for heterogeneous parallel functional languages

  Tim Zakian

  PhD Thesis , type= DPhil thesis. 2020.

  Details about Cost semantics for heterogeneous parallel functional languages | BibTeX data for Cost semantics for heterogeneous parallel functional languages | Link to Cost semantics for heterogeneous parallel functional languages

• [2]

  On the Non−Compositionality of Monads via Distributive Laws

  Maaike Zwart

  PhD Thesis Department of Computer Science‚ University of Oxford. September, 2020.

  Details about On the Non−Compositionality of Monads via Distributive Laws | BibTeX data for On the Non−Compositionality of Monads via Distributive Laws | Download  (pdf) of On the Non−Compositionality of Monads via Distributive Laws

• [3]

  Distributive Interaction of Algebraic Effects

  Kwok−Ho Cheung

  PhD Thesis 2017.

  Details about Distributive Interaction of Algebraic Effects | BibTeX data for Distributive Interaction of Algebraic Effects | Link to Distributive Interaction of Algebraic Effects

• [4]

  Completely iterative monads in semantics of coinductive programs

  Maciej Adam Pirog

  PhD Thesis , type= DPhil thesis. 2014.

  Details about Completely iterative monads in semantics of coinductive programs | BibTeX data for Completely iterative monads in semantics of coinductive programs | Link to Completely iterative monads in semantics of coinductive programs

• [5]

  Analysis and synthesis of inductive families

  Hsiang−Shang Ko

  PhD Thesis University of Oxford. 2014.

  Details about Analysis and synthesis of inductive families | BibTeX data for Analysis and synthesis of inductive families | Download (pdf) of Analysis and synthesis of inductive families

• [6]

  Genericity‚ extensibility and type−safety in the Visitor pattern

  Bruno C. d. S. Oliveira

  PhD Thesis 2007.

  Details about Genericity‚ extensibility and type−safety in the Visitor pattern | BibTeX data for Genericity‚ extensibility and type−safety in the Visitor pattern | Download  (pdf) of Genericity‚ extensibility and type−safety in the Visitor pattern | Download (pdf) of Genericity‚ extensibility and type−safety in the Visitor pattern

• [7]

  Obfuscation of Abstract Data−Types

  Stephen Drape

  PhD Thesis , type= DPhil Thesis. Oxford University Computing Laboratory. 2004.

  Details about Obfuscation of Abstract Data−Types | BibTeX data for Obfuscation of Abstract Data−Types | Download  (pdf) of Obfuscation of Abstract Data−Types

• [8]

  Functional Cryptography

  Stephen Drape

  Master's Thesis 2001.

  Details about Functional Cryptography | BibTeX data for Functional Cryptography | Download  (pdf) of Functional Cryptography

• [9]

  Projection−based Strictness Analysis — Theoretical and Practical Aspects

  Ralf Hinze

  PhD Thesis , type= Inauguraldissertation. Universität Bonn. November, 1995.

  Details about Projection−based Strictness Analysis — Theoretical and Practical Aspects | BibTeX data for Projection−based Strictness Analysis — Theoretical and Practical Aspects

• [10]

  Algebras for Tree Algorithms

  Jeremy Gibbons

  PhD Thesis , type= D.Phil. thesis. Programming Research Group‚ Oxford University. 1991.

  Available as Technical Monograph PRG−94. ISBN 0−902928−72−4

  Details about Algebras for Tree Algorithms | BibTeX data for Algebras for Tree Algorithms | Download (pdf) of Algebras for Tree Algorithms

• [11]

  A New View of Binary Trees

  Jeremy Gibbons

  Master's Thesis , type= Transferral dissertation. Programming Research Group‚ Oxford University. 1988.

  Abstract appears in the Bulletin of the EATCS‚ number 39‚ p. 214.

  Details about A New View of Binary Trees | BibTeX data for A New View of Binary Trees

Miscellaneous

• [1]

  Categorical organisation of the ornament–refinement framework

  Hsiang−Shang Ko and Jeremy Gibbons

  Submitted to POPL'14. July, 2013.

  Details about Categorical organisation of the ornament–refinement framework | BibTeX data for Categorical organisation of the ornament–refinement framework | Download (pdf) of Categorical organisation of the ornament–refinement framework

• [2]

  Sorting with Bialgebras and Distributive Laws

  Ralf Hinze‚ Daniel W.H. James‚ Thomas Harper‚ Nicolas Wu and José Pedro Magalhães

  May, 2012.

  Accepted to WGP '12

  Details about Sorting with Bialgebras and Distributive Laws | BibTeX data for Sorting with Bialgebras and Distributive Laws | Link to Sorting with Bialgebras and Distributive Laws

• [3]

  The Different Aspects of Monads and Mixins

  Bruno C. d. S. Oliveira

  2009.

  Draft Paper. Last Update: 04/03/2009. Submitted to ICFP 2009.

  Details about The Different Aspects of Monads and Mixins | BibTeX data for The Different Aspects of Monads and Mixins | Download  (pdf) of The Different Aspects of Monads and Mixins

• [4]

  Objects to Unify Type Classes and GADTs

  Bruno C. d. S. Oliveira and Martin Sulzmann

  2008.

  Details about Objects to Unify Type Classes and GADTs | BibTeX data for Objects to Unify Type Classes and GADTs

• [5]

  Report on Fourth Workshop on Commercial Users of Functional Programming

  Jeremy Gibbons

  December, 2007.

  Details about Report on Fourth Workshop on Commercial Users of Functional Programming | BibTeX data for Report on Fourth Workshop on Commercial Users of Functional Programming | Download (pdf) of Report on Fourth Workshop on Commercial Users of Functional Programming

• [6]

  Derivation of a Typed Functional LR Parser

  Ralf Hinze and Ross Paterson

  2003.

  in preparation

  Details about Derivation of a Typed Functional LR Parser | BibTeX data for Derivation of a Typed Functional LR Parser

• [7]

  Haskell 98 — A Non−strict‚ Purely Functional Language

  Simon Peyton Jones [editor]‚ John Hughes [editor]‚ Simon‚ Lennart Augustsson‚ Dave Barton‚ Brian Boutel‚ Warren Burton‚ Simon Fraser‚ Joseph Fasel‚ Kevin Hammond‚ Ralf Hinze‚ Paul Hudak‚ Thomas Johnsson‚ Mark Jones‚ John Launchbury‚ Erik Meijer‚ John Peterson‚ Alastair Reid‚ Colin Runciman and Philip Wadler

  Available from http://www.haskell.org/definition/. February, 1999.

  Details about Haskell 98 — A Non−strict‚ Purely Functional Language | BibTeX data for Haskell 98 — A Non−strict‚ Purely Functional Language

• [8]

  Lecture Notes on Algebraic and Coalgebraic Methods for Calculating Functional Programs

  Jeremy Gibbons

  March, 1999.

  Estonian Winter School on Computer Science

  Details about Lecture Notes on Algebraic and Coalgebraic Methods for Calculating Functional Programs | BibTeX data for Lecture Notes on Algebraic and Coalgebraic Methods for Calculating Functional Programs

• [9]

  Against the Grain: Linear−Time Breadth−First Tree Algorithms

  Jeremy Gibbons and Geraint Jones

  1998.

  Oxford Brookes University and Oxford University Computing Laboratory

  Details about Against the Grain: Linear−Time Breadth−First Tree Algorithms | BibTeX data for Against the Grain: Linear−Time Breadth−First Tree Algorithms

• [10]

  Hybrid Dynamic Programming

  Richard Bird and Oege de Moor

  1994.

  Programming Research Group‚ Oxford

  Details about Hybrid Dynamic Programming | BibTeX data for Hybrid Dynamic Programming

• [11]

  Einführung in die funktionale Programmierung − Sprachen‚ Spezifikationen‚ Grundlagen‚ Implementierung

  R. Hinze

  1992.

  Vorlesungsskript SS 92‚ Universität Bonn‚ Institut für Informatik III

  Details about Einführung in die funktionale Programmierung − Sprachen‚ Spezifikationen‚ Grundlagen‚ Implementierung | BibTeX data for Einführung in die funktionale Programmierung − Sprachen‚ Spezifikationen‚ Grundlagen‚ Implementierung