Richard S. Bird
According to our database1, Richard S. Bird
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:
On csauthors.net:
Bibliography
2015
How to mingle streams.
J. Funct. Program., 2015
2013
An in-situ algorithm for expanding a graph.
J. Funct. Program., 2013
Understanding idiomatic traversals backwards and forwards.
Proceedings of the 2013 ACM SIGPLAN Symposium on Haskell, 2013
2012
On building cyclic and shared structures in Haskell.
Formal Asp. Comput., 2012
2011
Building a consensus: A rectangle covering problem.
J. Funct. Program., 2011
A simple division-free algorithm for computing determinants.
Inf. Process. Lett., 2011
2009
Meeting a fanclub: a lattice of generic shape selectors.
Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming, 2009
2008
Zippy Tabulations of Recursive Functions.
Proceedings of the Mathematics of Program Construction, 9th International Conference, 2008
Spider Spinning for Dummies.
Proceedings of the Advanced Functional Programming, 6th International School, 2008
2007
Minimal on-line labelling.
Inf. Process. Lett., 2007
2006
Functional Pearl: Enumerating the rationals.
J. Funct. Program., 2006
Functional Pearls: Finding celebrities: A lesson in functional programming.
J. Funct. Program., 2006
Functional Pearl: A program to solve Sudoku.
J. Funct. Program., 2006
Loopless Functional Algorithms.
Proceedings of the Mathematics of Program Construction, 8th International Conference, 2006
Improving Saddleback Search: A Lesson in Algorithm Design.
Proceedings of the Mathematics of Program Construction, 8th International Conference, 2006
Fifteen years of functional pearls.
Proceedings of the 11th ACM SIGPLAN International Conference on Functional Programming, 2006
2005
Countdown: A case study in Origami programming.
J. Funct. Program., 2005
Polymorphic string matching.
Proceedings of the ACM SIGPLAN Workshop on Haskell, 2005
2004
Theory and applications of inverting functions as folds.
Sci. Comput. Program., 2004
Inverting the Burrows-Wheeler transform.
J. Funct. Program., 2004
On tiling a chessboard.
J. Funct. Program., 2004
2003
Functional Pearl trouble shared is trouble halved.
Proceedings of the ACM SIGPLAN Workshop on Haskell, 2003
Rebuilding a Tree from Its Traversals: A Case Study of Program Inversion.
Proceedings of the Programming Languages and Systems, First Asian Symposium, 2003
2002
Inverting Functions as Folds.
Proceedings of the Mathematics of Program Construction, 6th International Conference, 2002
Arithmetic Coding with Folds and Unfolds.
Proceedings of the Advanced Functional Programming, 2002
2001
Maximum marking problems.
J. Funct. Program., 2001
Unfolding pointer algorithms.
J. Funct. Program., 2001
Functional Quantum Programming.
Proceedings of the Second Asian Workshop on Programming Languages and Systems, 2001
2000
Algebraic Methods for Optimization Problems.
Proceedings of the Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, 2000
1999
De Bruijn Notation as a Nested Datatype.
J. Funct. Program., 1999
Generalised folds for nested datatypes.
Formal Asp. Comput., 1999
1998
Meertens Number.
J. Funct. Program., 1998
Nested Datatypes.
Proceedings of the Mathematics of Program Construction, 1998
1997
More Haste, Less Speed: Lazy Versus Eager Evaluation.
J. Funct. Program., 1997
On Building Trees with Minimum Height.
J. Funct. Program., 1997
On Merging and Selection.
J. Funct. Program., 1997
On Computing Representatives.
Inf. Process. Lett., 1997
Allegories as a Basis for Algorithmics.
Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997
Algebra of programming.
Prentice Hall International series in computer science, Prentice Hall, ISBN: 978-0-13-507245-5, 1997
1996
Functional Algorithm Design.
Sci. Comput. Program., 1996
Generic Functional Programming with Types and Relations.
J. Funct. Program., 1996
The algebra of programming.
Proceedings of the NATO Advanced Study Institute on Deductive Program Design, 1996
1995
Functional Algorithm Design.
Proceedings of the Mathematics of Program Construction, 1995
1993
Functional Pearls: The Last Tail.
J. Funct. Program., 1993
List Partitions.
Formal Asp. Comput., 1993
From Dynamic Programming to Greedy Algorithms.
Proceedings of the Formal Program Development - IFIP TC2/WG 2.1 State-of-the-Art Report, 1993
1992
The Smallest Upravel.
Sci. Comput. Program., 1992
Unravelling Greedy Algorithms.
J. Funct. Program., 1992
Two Greedy Algorithms.
J. Funct. Program., 1992
Solving Optimisation Problems with Catamorphism.
Proceedings of the Mathematics of Program Construction, Second International Conference, Oxford, U.K., June 29, 1992
Einführung in die funktionale Programmierung.
Hanser Studienbücher der Informatik, Hanser, ISBN: 978-3-446-17001-8, 1992
1991
On Removing Duplicates.
J. Funct. Program., 1991
The Minout Problem.
J. Funct. Program., 1991
1989
Formal Derivation of a Pattern Matching Algorithm.
Sci. Comput. Program., 1989
Algebraic Identities for Program Calculation.
Comput. J., 1989
1988
Introduction to functional programming.
Prentice Hall International series in computer science, Prentice Hall, ISBN: 978-0-13-484197-7, 1988
1987
A Formal Development of an Efficient Subercombinator Compiler.
Sci. Comput. Program., 1987
The alpha-beta Algorithm: An Exercise in Program Transformation.
Inf. Process. Lett., 1987
1986
Transformational Programming and the Paragraph Problem.
Sci. Comput. Program., 1986
1985
Addendum to "The Promotion and Accumulation Strategies in Transformational Programming".
ACM Trans. Program. Lang. Syst., 1985
1984
The Promotion and Accumulation Strategies in Transformational Programming.
ACM Trans. Program. Lang. Syst., 1984
Using Circular Programs to Eliminate Multiple Traversals of Data.
Acta Inf., 1984
1981
The Jogger's Problem.
Inf. Process. Lett., 1981
Surveyor's Forum: A Recurring Bug.
ACM Comput. Surv., 1981
1980
Tabulation Techniques for Recursive Programs.
ACM Comput. Surv., 1980
1979
Recursion Elimination with Variable Parameters.
Comput. J., 1979
1977
Two Dimensional Pattern Matching.
Inf. Process. Lett., 1977
Improving Programs by the Introduction of Recursion.
Commun. ACM, 1977
Notes on Recursion Elimination.
Commun. ACM, 1977
1974
Computational complexity on register machines.
PhD thesis, 1974
On Transformations of Programs.
J. Comput. Syst. Sci., 1974
Speeding up Programs.
Comput. J., 1974