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 2022-01-01 to 2026-01-01.)
ArticleCitations
Bottom-up computation using trees of sublists6
Domain-specific tensor languages6
The graphical theory of monads6
Contract lenses: Reasoning about bidirectional programs via calculation6
Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant6
A correct-by-construction conversion from lambda calculus to combinatory logic5
Type-directed operational semantics for gradual typing5
Review of “Real World OCaml: Functional Programming for the Masses” Second Edition, by Yaron Minsky and Anil Madhavapeddy, 20234
A contextual formalization of structural coinduction3
Programming language semantics: It’s easy as 1,2,33
On being a PhD student of Robert Harper3
Level-p-complexity of Boolean functions using thinning, memoization, and polynomials2
ANF preserves dependent types up to extensional equality2
A practical formalization of monadic equational reasoning in dependent-type theory2
Review of “Haskell in Depth” by Vitaly Bragilevsky, Manning Publications, 20212
PhD Abstracts2
Binary search—think positive1
Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq1
Parallel dual-numbers reverse AD1
PhD Abstracts1
Classical (co)recursion: Mechanics1
Static Blame for gradual typing1
Is sized typing for Coq practical?1
PhD Abstracts1
Modal FRP for all: Functional reactive programming without space leaks in Haskell1
Send to me first: Priority in synchronous message-passing1
PhD Abstracts1
Automatically testing console I/O behavior of student submissions in Haskell0
Towards type-directed compiler calculation0
Signature restriction for polymorphic algebraic effects0
Checking equivalence in a non-strict language0
Alice or Bob?: Process polymorphism in choreographies0
Denotational semantics as a foundation for cost recurrence extraction for functional languages0
Read/write factorizable programs0
Tail recursion modulo context: An equational approach (extended version)0
Recursive subtyping for all0
An example of goal-directed, calculational proof0
You could have invented Fenwick trees0
PhD Abstracts0
PhD Abstracts0
How much is in a square? Calculating functional programs with squares0
Iterating on multiple collections in synchrony0
Migrating gradual types0
Experiences of early assessment to teach functional programming0
Asymptotic speedup via effect handlers0
Knuth–Morris–Pratt illustrated0
Call-by-value and call-by-name: A simple proof of a classic theorem0
Turner, Bird, Eratosthenes: An eternal burning thread0
A simple blame calculus for explicit nulls0
Trace contracts0
JFP special issue on program calculation0
Folding left and right matters: Direct style, accumulators, and continuations0
From high to low: Simulating nondeterminism and state with state0
PhD Abstracts0
Super-naturals0
Editorial0
OCaml Blockly0
Algebraic effects and handlers for arrows0
A type-directed, dictionary-passing translation of method overloading and structural subtyping in Featherweight Generic Go0
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
Back to futures0
Programming and reasoning about actors that share state0
PhD Abstracts0
Point-free calculational proofs and program derivation in linear algebra using a graphical syntax0
Inductive synthesis of structurally recursive functional programs from non-recursive expressions0
Normalization by evaluation for modal dependent type theory0
Sparcl: A language for partially invertible computation0
Fregel: a functional domain-specific language for vertex-centric large-scale graph processing0
Extracting functional programs from Coq, in Coq0
Certified, total serialisers with an application to Huffman encoding0
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant – ERRATUM0
0.042343139648438