J
Jeremy Gibbons
Researcher at University of Oxford
Publications - 190
Citations - 3479
Jeremy Gibbons is an academic researcher from University of Oxford. The author has contributed to research in topics: Haskell & Monad (functional programming). The author has an hindex of 30, co-authored 186 publications receiving 3273 citations. Previous affiliations of Jeremy Gibbons include Oxford Brookes University & University of Auckland.
Papers
More filters
Book ChapterDOI
A Process Semantics for BPMN
Peter Y. H. Wong,Jeremy Gibbons +1 more
TL;DR: This paper shows how a subset of the BPMN can be given a process semantics in Communicating Sequential Processes, which allows developers to formally analyse and compare BPMn diagrams.
Book ChapterDOI
Notions of Bidirectional Computation and Entangled State Monads
TL;DR: This work builds on the mature theory of monadic encapsulation of effects in functional programming, develops the equational theory and important combinators for effectful bx, and provides a prototype implementation in Haskell along with several illustrative examples.
Book
Algebraic and coalgebraic methods in the mathematics of program construction : international summer school and workshop Oxford, UK, April 10-14, 2000, revised lectures
TL;DR: In this article, Galois Connections and Fixed Point Calculus are used to calculate functional programs and algebraic methods for optimization problems in the context of finite point calculus and temporal algebra.
Proceedings ArticleDOI
Fast and loose reasoning is morally correct
TL;DR: It is proved that if two closed terms have the same semantics in the total language, then they have related semantics inthe partial language, and it is shown that the PER gives rise to a bicartesian closed category which can be used to reason about values in the domain of the relation.
Book ChapterDOI
Datatype-generic programming
TL;DR: This lecture notes expands on the definition of datatype-generic programming, and explores the connection with design patterns in object-oriented programming; in particular, it is argued that certain design patterns are just higher-order datatypes-generic programs.