Journal of Functional Programming

We're delighted to announce that the JFP Special Issue on Program Calculation is now complete, and contains eleven papers that are freely available to read online from the link below. tinyurl.com/JFP-prog-calc

If you or one of your students recently completed a PhD (or Habilitation) in the area of functional programming, please submit the abstract for publication in JFP: simple process, no refereeing, open access, 200+ published to date, deadline 30th Nov 2025. tinyurl.com/jfp-phd-abstract…

Biernacki, McKinna and Sieczkowski present a simple new proof of the classic theorem that call-by-value evaluation can be simulated by call-by-name evaluation. cambridge.org/core/journals/…

From Daan Leijen and @anton_lorenzen: an extended version of their POPL 2023 paper, "Tail Recursion Modulo Context: An Equational Approach", which calculates a generalisation of the "tail recursion modulo cons" optimisation from its specification. cambridge.org/core/journals/…

Oliver Westphal and Janis Voigtländer present a formal specification language and automated testing framework for the console I/O behaviour of student-submitted programs. cambridge.org/core/journals/…

In Education Matters, Kenichi Asai presents OCaml Blockly -- an educational block-based programming environment for beginners, like Google Blockly -- but for OCaml! cambridge.org/core/journals/…

Alexander Dinges and Ralf Hinze present a dramatic pearl about binary search with Agda. cambridge.org/core/journals/…

Ralf Hinze and Dan Marsden present a graphical calculational technique based on string diagrams, and use it to explain the theory of monads. cambridge.org/core/journals/…

J.P. Bernardy and P. Jansson present a new Haskell-embedded domain specific language for naturally expressing tensor computations using natural index notation. cambridge.org/core/journals/…

Litao Zhou, Yaoda Zhou, Qianyong Wan and Bruno C.D.S. Oliveira present a new calculus extending F_≤ (a calculus w/ bounded quantification) with isorecursive types, tackling the tricky combination of subtyping, recursive types, and bounded quantification. cambridge.org/core/journals/…

José Nuno Oliveira writes this pearl exploring "magic squares" --- (semi-)commutative squares. These squares underpin much of what we do in logic, FP, database modelling, formal semantics and so on. cambridge.org/core/journals/…

Brent Yorgey reviews Vitaly Bragilevsky's book, "Haskell in Depth" cambridge.org/core/journals/…

In Education Matters, Peter Chapman reports on the use of Use-Modify-Create scaffolds to teach first-year undergraduate functional programming. This early assessment intervention showed promising improvements to student scores. cambridge.org/core/journals/…

Read Jeremy Gibbons' pearl exploring Richard Bird's Sieve of Eratosthenes circular algorithm through the lens of Turner's Total Functional Programming. cambridge.org/core/journals/…

Read Brent Yorgey's functional pearl calculating an efficient implementation of Fenwick trees from a straightfoward, purely functional segment tree. cambridge.org/core/journals/…

In this paper, Reynald Affeldt, Jacques Garrigue and Takafumi Saikawa present a framework embedded inside Rocq for practical equational reasoning about programs with effects using a formalisation of a hierarchy of effects. cambridge.org/core/journals/…