OXFORD UNIVERSITY COMPUTING LABORATORY

Jeremy Gibbons: Publications

by date |  by title |  by type |  bibtex

[1]

A New View of Binary Trees

Jeremy Gibbons

Master's Thesis. Programming Research Group, Oxford University, 1988.

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

[2]

A Pointless Derivation of Radixsort

Jeremy Gibbons

Journal of Functional Programming, Vol. 9, No. 3, pages 339—346. 1999.

[3]

A Process Semantics for BPMN

Peter Wong, Jeremy Gibbons

In International Conference on Formal Engineering Methods Kitakyushu, Japan. September 2008.

[4]

A Process-Algebraic Approach to Workflow Specification and Refinement

Peter Y. H. Wong, Jeremy Gibbons

In Software Composition 2007.

[5]

A Relative Timed Semantics for BPMN

Peter Wong, Jeremy Gibbons

In Foundations of Coordination Languages and Software Architectures (FOCLASA) Zurich. July 2008.

[6]

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

Jeremy Gibbons, Geraint Jones

1998.

Oxford Brookes University and Oxford University Computing Laboratory.

[7]

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.

[8]

Algebraic and Coalgebraic Methods in the Mathematics of Program Construction

Roland Backhouse, Roy Crole and Jeremy Gibbons, editors

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

[9]

Algebras for Tree Algorithms

Jeremy Gibbons

PhD Thesis, Programming Research Group, Oxford University. 1991.

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

[10]

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.

[11]

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.

[12]

An Unbounded Spigot Algorithm for the Digits of π

Jeremy Gibbons

American Mathematical Monthly, Vol. 113, No. 4, pages 318-328. 2006.

[13]

Arithmetic Coding with Folds and Unfolds

Richard Bird, Jeremy Gibbons

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

Code available at http://www.comlab.ox.ac.uk/oucl/work/jeremy.gibbons/publications/arith.zip

[14]

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

Oege de Moor, Jeremy Gibbons

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

[15]

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.

[16]

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.

[17]

Combinatorics, Complexity and Logic: Proceedings of Discrete Mathematics and Theoretical Computer Science

Douglas Bridges et al. , editors

Singapore. 1996. Springer-Verlag.

[18]

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.

Revised version Gibbons96:Computing.

[19]

Computing Downwards Accumulations on Trees Quickly

Jeremy Gibbons

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.

[20]

Conditionals in Distributive Categories

Jeremy Gibbons

No. CMS-TR-97-01, Technical Report, School of Computing and Mathematical Sciences, Oxford Brookes University. January 1997.

[21]

Cross-Trial Query System for Cancer Clinical Trials

Radu Calinescu et al.

In International Joint Conferences on Computer, Information and Systems Sciences and Engineering (CISSE) December 2006.

[22]

Datatype-Generic Programming

Jeremy Gibbons

In Roland Backhouse et al. , editors, Spring School on Datatype-Generic Programming Vol. 4719 of Lecture Notes in Computer Science. Springer-Verlag, 2007.

[23]

Deriving Tidy Drawings of Trees

Jeremy Gibbons

Journal of Functional Programming, Vol. 6, No. 3, pages 535—562. 1996.

[24]

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.

[25]

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.

[26]

Design Patterns as Higher-Order Datatype-Generic Programs

Jeremy Gibbons

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

[27]

Disciplined, efficient, generalised folds for nested datatypes

Clare Martin, Jeremy Gibbons and Ian Bayley

Formal Aspects of Computing, Vol. 16, No. 1, pages 19-35. 2004.

[28]

Dotted and Dashed Lines in Metafont

Jeremy Gibbons

In Robin Fairbairns, editor, Proceedings of the 1995 Annual Meeting \TeX Users' Group. 1995.

[29]

Efficient Parallel Algorithms for Tree Accumulations

Jeremy Gibbons, Wentong Cai and David Skillicorn

Science of Computer Programming, Vol. 23, pages 1—18. 1994.

[30]

Enumerating the Rationals

Jeremy Gibbons, David Lester and Richard Bird

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

[31]

Fast and Loose Reasoning is Morally Correct

Nils Anders Danielsson et al.

In Principles of Programming Languages pages 206-217. January 2006.

[32]

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.

[33]

Formal Derivation of a Pattern Matching Algorithm

Richard S. Bird, Jeremy Gibbons and Geraint Jones

Science of Computer Programming, Vol. 12, No. 2, pages 93—104. July 1989.

[34]

Formal Methods: Why Should I Care? The Development of the T800 Transputer Floating-Point Unit

Jeremy Gibbons

In John Hosking, editor, Proceedings of the 13th New Zealand Computer Society Conference pages 207—217. 1993.

[35]

Generic Downwards Accumulations

Jeremy Gibbons

Science of Computer Programming, Vol. 37, pages 37—65. 2000.

[36]

Generic Programming

Jeremy Gibbons, Johan Jeuring, editors

Kluwer Academic Publishers. 2003.

Proceedings of the IFIP TC2 Working Conference on Generic Programming, Schloß Dagstuhl, July 2002. ISBN 1-4020-7374-7.

[37]

Generic and Indexed Programming

Jeremy Gibbons, Meng Wang and Bruno César dos Santos Oliveira

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

[38]

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, p. 105—126.

[39]

Integrated Formal Methods

Jim Davies, Jeremy Gibbons, editors

Vol. 4591 of Lecture Notes in Computer Science. Springer-Verlag. 2007.

[40]

Lecture Notes on Algebraic and Coalgebraic Methods for Calculating Functional Programs

Jeremy Gibbons

March 1999.

Estonian Winter School on Computer Science.

[41]

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

Geraint Jones, Jeremy Gibbons

No. No.\,71, Technical Report, Dept of Computer Science, University of Auckland. May 1993.

Also IFIP Working Group 2.1 working paper 705 WIN-2.

[42]

Metamorphisms: Streaming Representation-Changers

Jeremy Gibbons

Science of Computer Programming, Vol. 65, pages 108-139. 2007.

[43]

Model-Driven Architecture for Cancer Research

Radu Calinescu et al.

In Software Engineering and Formal Methods September 2007.

[44]

More on Merging and Selection

Jeremy Gibbons

No. CMS-TR-97-08, Technical Report, School of Computing and Mathematical Sciences, Oxford Brookes University. October 1997.

[45]

On Specifying and Visualising Long-Running Empirical Studies

Peter Y. H. Wong, Jeremy Gibbons

In International Conference on Model Transformations (ICMT) 2008.

[46]

On The Supervision and Assessment Of Part-Time Postgraduate Software Engineering Projects

Andrew Simpson et al.

In International Conference on Software Engineering pages 628-633. 2003.

[47]

On the Semantics of Nested Datatypes

Clare Martin, Jeremy Gibbons

Information Processing Letters, Vol. 80, No. 5, pages 233—238. December 2001.

[48]

Origami Programming

Jeremy Gibbons

In Jeremy Gibbons, Oege de Moor, editors, The Fun of Programming pages 41-60. Palgrave. 2003.

[49]

Parametric Datatype-Genericity

Jeremy Gibbons, Ross Paterson

2008.

Submitted for publication.

[50]

Patterns in Datatype-Generic Programming

Jeremy Gibbons

In Jörg Striegnitz, 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).

[51]

Pointwise Relational Programming

Oege de Moor, Jeremy Gibbons

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

[52]

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.

[53]

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.

[54]

Proof Methods for Corecursive Programs

Jeremy Gibbons, Graham Hutton

Fundamenta Informaticae, Vol. 66, No. 4, pages 353-366. 2005.

[55]

Proof Methods for Structured Corecursive Programs

Jeremy Gibbons, Graham Hutton

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

[56]

Report on Fourth Workshop on Commercial Users of Functional Programming

Jeremy Gibbons

December 2007.

[57]

Scala for Generic Programmers

Bruno Oliveira, Jeremy Gibbons

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

[58]

Semantic Frameworks for e-Government

Charles Crichton et al.

In Theresa Pardo, Tomasz Janowski, editors, First International Conference on Theory and Practice of Electronic Governance (ICEGOV) 2007 pages 30—39. ACM, December 2007.

[59]

Spring School on Datatype-Generic Programming

Roland Backhouse et al. , editors

Vol. 4719 of Lecture Notes in Computer Science. Springer-Verlag. 2007.

[60]

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

[61]

Structured Programming in Java

Jeremy Gibbons

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.

[62]

Summer School on Generic Programming

Roland Backhouse, Jeremy Gibbons, editors

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

[63]

The Essence of the Iterator Pattern

Jeremy Gibbons, Bruno César dos Santos Oliveira

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

Superseded by Gibbons&Oliveira2008:Essence.

[64]

The Essence of the Iterator Pattern

Jeremy Gibbons, Bruno César dos Santos Oliveira

Journal of Functional Programming, 2008.

Revised version of Gibbons&Oliveira2006:Essence.

[65]

The Fun of Programming

Jeremy Gibbons, Oege de Moor, editors

Palgrave. 2003.

ISBN 1-4039-0772-2.

[66]

The Generic Approximation Lemma

Graham Hutton, Jeremy Gibbons

Information Processing Letters, Vol. 79, No. 4, pages 197—201. August 2001.

[67]

The Third Homomorphism Theorem

Jeremy Gibbons

Journal of Functional Programming, Vol. 6, No. 4, pages 657—665. 1996.

Earlier version appeared in C. B. Jay, editor, Computing: The Australian Theory Seminar, Sydney, December 1994, p. 62—69.

[68]

The Under-Appreciated Unfold

Jeremy Gibbons, Geraint Jones

In International Conference on Functional Programming pages 273—279. Baltimore, Maryland. September 1998.

[69]

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.

[70]

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.

[71]

Tracing Lazy Functional Languages

Jeremy Gibbons, Keith Wansbrough

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

[72]

TypeCase: A Design Pattern for Type-Indexed Functions

Bruno César dos Santos Oliveira, Jeremy Gibbons

In Daan Leijen, editor, Haskell Workshop pages 98-109. 2005.

[73]

Unfolding Abstract Datatypes

Jeremy Gibbons

In Mathematics of Program Construction July 2008.

[74]

Unifying Theories of Locations

Michael Anthony Smith, Jeremy Gibbons

In Andrew Butterfield, editor, Unifying Theories of Programming Dublin. September 2008.

[75]

Unifying Theories of Objects

Michael Anthony Smith, Jeremy Gibbons

In Jim Davies, Jeremy Gibbons, editors, Integrated Formal Methods Vol. 4591 of Lecture Notes in Computer Science, pages 599-618. Springer-Verlag, 2007.

[76]

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.

[77]

Verifying Business Process Compatibility

Peter Wong, Jeremy Gibbons

In 8th International Conference on Quality Software (QSIC) 2008.

Earlier versions of this paper were presented at the 2nd European Young Researchers Workshop on Service Oriented Computing, Leicester, United Kingdom, June 2007, and 3rd International Workshop on Methods and Tools for Coordinating Concurrent, Distributed and Mobile Systems (MTCoord'07), Paphos, Cyprus, June 2007.

[78]

WSRF-Based Modeling of Clinical Trial Information for Collaborative Cancer Research

Tianyi Zang et al.

In 8th IEEE International Symposium on Cluster Computing (CCGrid) 2008.

[79]

When is a Function a Fold or an Unfold?

Jeremy Gibbons, Graham Hutton and Thorsten Altenkirch

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

Proceedings of Coalgebraic Methods in Computer Science.

Random Image
Random Image
Random Image