Journal of Functional Programming

Papers
(The TQCC 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-03-01 to 2025-03-01.)
ArticleCitations
Migrating gradual types4
Is sized typing for Coq practical?4
Programming language semantics: It’s easy as 1,2,33
Review of “Real World OCaml: Functional Programming for the Masses” Second Edition, by Yaron Minsky and Anil Madhavapeddy, 20232
Fregel: a functional domain-specific language for vertex-centric large-scale graph processing2
Sparcl: A language for partially invertible computation2
PhD Abstracts1
PhD Abstracts1
Level-p-complexity of Boolean functions using thinning, memoization, and polynomials1
PhD Abstracts1
Certified, total serialisers with an application to Huffman encoding1
Denotational semantics as a foundation for cost recurrence extraction for functional languages1
An example of goal-directed, calculational proof1
On being a PhD student of Robert Harper1
A type-directed, dictionary-passing translation of method overloading and structural subtyping in Featherweight Generic Go0
PhD Abstracts0
Asymptotic speedup via effect handlers0
A review for the Journal of Functional Programming of Sandy Maguire, Algebra-Driven Design (Leanpub, 2020).0
Super-naturals0
ANF preserves dependent types up to extensional equality0
Programming and reasoning about actors that share state0
Trace contracts0
Signature restriction for polymorphic algebraic effects0
Knuth–Morris–Pratt illustrated0
PhD Abstracts0
You could have invented Fenwick trees0
Static Blame for gradual typing0
Alice or Bob?: Process polymorphism in choreographies0
Extracting functional programs from Coq, in Coq0
Algebraic effects and handlers for arrows0
A correct-by-construction conversion from lambda calculus to combinatory logic0
Back to futures0
Recursive subtyping for all0
How much is in a square? Calculating functional programs with squares0
A well-known representation of monoids and its application to the function ‘vector reverse’0
PhD Abstracts0
Read/write factorizable programs0
Classical (co)recursion: Mechanics0
Contract lenses: Reasoning about bidirectional programs via calculation0
Iterating on multiple collections in synchrony0
PhD Abstracts0
Normalization by evaluation for modal dependent type theory0
Experiences of early assessment to teach functional programming0
Type-directed operational semantics for gradual typing0
From high to low: Simulating nondeterminism and state with state0
Editorial0
Bottom-up computation using trees of sublists0
Modal FRP for all: Functional reactive programming without space leaks in Haskell0
Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant0
Folding left and right matters: Direct style, accumulators, and continuations0
A simple blame calculus for explicit nulls0
Send to me first: Priority in synchronous message-passing0
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant – ERRATUM0
A practical formalization of monadic equational reasoning in dependent-type theory0
Review of “Haskell in Depth” by Vitaly Bragilevsky, Manning Publications, 20210
Turner, Bird, Eratosthenes: An eternal burning thread0
0.034398078918457