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