FP friends -- please encourage recently completed PhD students to publish their dissertation abstracts in the Journal of Functional Programming: simple process, no refereeing, open access, 200+ published to date, deadline 31st May 2024. Please share! tinyurl.com/jfp-phd-abstra…

Read Michael Sperber's review for JFP of Sandy Maguire's book, Algebra-Driven Design: cambridge.org/core/journals/…

Attending #ICFP24 or interested in functional programming? Journal of Functional Programming's collection page features a wide variety of article collections from previous ICFP conferences. Enjoy the collections → cup.org/3MxHY66 Journal of Functional Programming

FP fans - 11 new PhD abstracts have just been published in the Journal of Functional Programming, with links to the full dissertations! doi.org/10.1017/S09567…

New paper: Wenjia Ye and Bruno C.D.S. Oliveira present a new method of giving semantics to gradually typed languages, using type-directed operational semantics, where type annotations become operationally relevant. cambridge.org/core/journals/…

New paper: Sanada presents an arrow calculus extended with algebraic effects and handlers. Includes operational and denotational semantics (given using a strong (pro)monad in the bicategory of categories and profunctors), soundness and adequacy proofs. cambridge.org/core/journals/…

New Paper: Caldwell, Garnock-Jones and Felleisen allow programmers to state temporal aspects of actor conversations in dataspace actor languages. They present a design of a language of _facets_ and a system for reasoning about their temporal behaviour. cambridge.org/core/journals/…

Have a read of Shin-Cheng Mu's beautiful functional pearl on deriving an algorithm for bottom-up computation using trees of sublists: cambridge.org/core/journals/…

Speaking of pearls, we also have Backhouse, Guttmann and Winter's pearl, showing a neat example of a goal-directed, calculational proof: constructing an equivalence relation from a given relation by way of a starth root construction. cambridge.org/core/journals/…

New paper: Lhoták and Wadler present a simpler blame calculus for gradual typing of languages where types explicitly indicate whether null values are permitted. cambridge.org/core/journals/…

Read Wenhao Tang and Tom Schrijvers 's paper on simulating nondeterminism and state (high level effects) in terms of low-level state, proving each step of the refinement correct by program calculation. 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/…

Read Brent Yorgey's functional pearl calculating an efficient implementation of Fenwick trees from a straightfoward, purely functional segment tree. 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/…

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/…

Brent Yorgey reviews Vitaly Bragilevsky's book, "Haskell in Depth" 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/…

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/…