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