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-06-01 to 2026-06-01.)
ArticleCitations
Contract lenses: Reasoning about bidirectional programs via calculation7
Domain-specific tensor languages7
The graphical theory of monads6
Bottom-up computation using trees of sublists4
Type-directed operational semantics for gradual typing3
A correct-by-construction conversion from lambda calculus to combinatory logic3
A practical formalization of monadic equational reasoning in dependent-type theory2
Review of “Real World OCaml: Functional Programming for the Masses” Second Edition, by Yaron Minsky and Anil Madhavapeddy, 20232
PhD Abstracts2
Programming language semantics: It’s easy as 1,2,32
Level-p-complexity of Boolean functions using thinning, memoization, and polynomials2
A contextual formalization of structural coinduction2
Review of “Haskell in Depth” by Vitaly Bragilevsky, Manning Publications, 20211
Binary search—think positive1
Static Blame for gradual typing1
Parallel dual-numbers reverse AD1
Is sized typing for Coq practical?1
Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq1
PhD Abstracts1
Classical (co)recursion: Mechanics1
Point-free calculational proofs and program derivation in linear algebra using a graphical syntax0
Experiences of early assessment to teach functional programming0
Sparcl : A language for partially invertible computation0
How much is in a square? Calculating functional programs with squares0
OCaml Blockly0
PhD Abstracts0
Inductive synthesis of structurally recursive functional programs from non-recursive expressions0
Alice or Bob?: Process polymorphism in choreographies0
A review for the Journal of Functional Programming of Sandy Maguire, Algebra-Driven Design (Leanpub, 2020).0
A simple blame calculus for explicit nulls0
Tail recursion modulo context: An equational approach (extended version)0
Read/write factorizable programs0
You could have invented Fenwick trees0
Trace contracts0
Turner, Bird, Eratosthenes: An eternal burning thread0
Certified, total serialisers with an application to Huffman encoding0
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant – ERRATUM0
Automatically testing console I/O behavior of student submissions in Haskell0
A type-directed, dictionary-passing translation of method overloading and structural subtyping in Featherweight Generic Go0
Asymptotic speedup via effect handlers0
Knuth–Morris–Pratt illustrated0
Call-by-value and call-by-name: A simple proof of a classic theorem0
Towards type-directed compiler calculation0
Folding left and right matters: Direct style, accumulators, and continuations0
Recursive subtyping for all0
PhD Abstracts0
JFP special issue on program calculation0
An example of goal-directed, calculational proof0
PhD Abstracts0
Hefty algebras: Modular elaboration of higher-order effects0
From high to low: Simulating nondeterminism and state with state0
Algebraic effects and handlers for arrows0
Signature restriction for polymorphic algebraic effects0
Checking equivalence in a non-strict language0
Normalization by evaluation for modal dependent type theory0
Programming and reasoning about actors that share state0
Semantics of pattern unification0
0.068045854568481