JFP 2025
26 papers
- A contextual formalization of structural coinduction
- A practical formalization of monadic equational reasoning in dependent-type theory
- Automatically testing console I/O behavior of student submissions in Haskell
- Binary search - think positive
- Call-by-value and call-by-name: A simple proof of a classic theorem
- Checking equivalence in a non-strict language
- Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq
- Domain-specific tensor languages
- Experiences of early assessment to teach functional programming
- Hefty algebras: Modular elaboration of higher-order effects
- How much is in a square? Calculating functional programs with squares
- Inductive synthesis of structurally recursive functional programs from non-recursive expressions
- JFP special issue on program calculation
- OCaml Blockly
- Parallel dual-numbers reverse AD
- PhD Abstracts
- PhD Abstracts
- Point-free calculational proofs and program derivation in linear algebra using a graphical syntax
- Recursive subtyping for all
- Review of "Haskell in Depth" by Vitaly Bragilevsky, Manning Publications, 2021
- Semantics of pattern unification
- Tail recursion modulo context: An equational approach (extended version)
- The graphical theory of monads
- Towards type-directed compiler calculation
- Turner, Bird, Eratosthenes: An eternal burning thread
- You could have invented Fenwick trees