Journal of Functional Programming

Papers
(The median citation count of Journal of Functional Programming is 0. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-10-01 to 2025-10-01.)
ArticleCitations
Contract lenses: Reasoning about bidirectional programs via calculation6
Domain-specific tensor languages6
The graphical theory of monads5
Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant5
Bottom-up computation using trees of sublists4
A correct-by-construction conversion from lambda calculus to combinatory logic3
Type-directed operational semantics for gradual typing3
Review of “Real World OCaml: Functional Programming for the Masses” Second Edition, by Yaron Minsky and Anil Madhavapeddy, 20233
On being a PhD student of Robert Harper2
A practical formalization of monadic equational reasoning in dependent-type theory2
Programming language semantics: It’s easy as 1,2,32
A contextual formalization of structural coinduction2
PhD Abstracts2
Level-p-complexity of Boolean functions using thinning, memoization, and polynomials2
Modal FRP for all: Functional reactive programming without space leaks in Haskell1
Review of “Haskell in Depth” by Vitaly Bragilevsky, Manning Publications, 20211
Classical (co)recursion: Mechanics1
Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq1
ANF preserves dependent types up to extensional equality1
Static Blame for gradual typing1
Parallel dual-numbers reverse AD1
Send to me first: Priority in synchronous message-passing1
Binary search—think positive1
PhD Abstracts1
Knuth–Morris–Pratt illustrated0
Read/write factorizable programs0
Denotational semantics as a foundation for cost recurrence extraction for functional languages0
Recursive subtyping for all0
PhD Abstracts0
Migrating gradual types0
You could have invented Fenwick trees0
Turner, Bird, Eratosthenes: An eternal burning thread0
Fregel: a functional domain-specific language for vertex-centric large-scale graph processing0
Editorial0
OCaml Blockly0
Is sized typing for Coq practical?0
Programming and reasoning about actors that share state0
From high to low: Simulating nondeterminism and state with state0
A review for the Journal of Functional Programming of Sandy Maguire, Algebra-Driven Design (Leanpub, 2020).0
A well-known representation of monoids and its application to the function ‘vector reverse’0
Trace contracts0
A simple blame calculus for explicit nulls0
Inductive synthesis of structurally recursive functional programs from non-recursive expressions0
Normalization by evaluation for modal dependent type theory0
An example of goal-directed, calculational proof0
PhD Abstracts0
PhD Abstracts0
A type-directed, dictionary-passing translation of method overloading and structural subtyping in Featherweight Generic Go0
Certified, total serialisers with an application to Huffman encoding0
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant – ERRATUM0
PhD Abstracts0
Super-naturals0
Alice or Bob?: Process polymorphism in choreographies0
Signature restriction for polymorphic algebraic effects0
Towards type-directed compiler calculation0
Checking equivalence in a non-strict language0
Point-free calculational proofs and program derivation in linear algebra using a graphical syntax0
Back to futures0
Sparcl: A language for partially invertible computation0
Folding left and right matters: Direct style, accumulators, and continuations0
Automatically testing console I/O behavior of student submissions in Haskell0
PhD Abstracts0
Extracting functional programs from Coq, in Coq0
Experiences of early assessment to teach functional programming0
Iterating on multiple collections in synchrony0
PhD Abstracts0
How much is in a square? Calculating functional programs with squares0
Algebraic effects and handlers for arrows0
Asymptotic speedup via effect handlers0
1.8537302017212