wal.sh
home > events > icfp-2026 · Jan 01, 2026
functional programmingicfpacm sigplanminikanrenrelational programminglogic programmingindianapolis

ICFP 2026

Basics

Field Value
Dates <2026-08-24 Mon>–<2026-08-29 Sat>
Venue Indiana University Indianapolis, Indianapolis, USA
Host ACM SIGPLAN
URL icfp26.sigplan.org
Format Multi-track with co-located workshops
Framing Functional programming research; miniKanren relational programming

Registration status (as of 2026-07-24)

⚠ Early registration rates end 2026-07-24 — today. Other near dates from icfp26.sigplan.org:

Date Item
2026-07-21 Scheme Workshop camera-ready (passed)
2026-07-24 Early registration rates end
2026-07-24 LOPSTR+PPDP final version due
2026-08-10 FUNARCH lightning-talk submissions due

Format: in-person with remote participation; talks live-streamed.

Keynotes

Speaker Title
Edward Lee Deterministic Concurrency
Lindsey Kuper Interpreters everywhere!
Daan Leijen Efficient strong functional programming with effects and compiler guided reference counting

Leijen's is the one to attend for the Koka/effect-handler line — effects plus compiler-guided reference counting is the performance argument for effect systems, not just the expressiveness one. Kuper on interpreters is the distributed-systems-meets-PL angle; Lee on deterministic concurrency is the Lingua Franca / model-of-computation position.

Co-located events

PLMW @ ICFP (mentoring) · HOPE (higher-order programming with effects) · miniKanren · FARM (functional art, music, modelling, design) · LOPSTR+PPDP · ML Family Workshop · FUNARCH (functional software architecture) · Scheme Workshop · Erlang Workshop · OCaml Workshop (watch party) · Haskell Symposium (co-hosted).

miniKanren Workshop 2026

Field Value
Date <2026-08-24 Mon>
Deadline 2026-05-17 AoE (UTC-12)
Notify 2026-06-16
Camera 2026-06-28
Portal minikanren26.hotcrp.com
Proceedings arxiv.org

Co-chairs

  • Chris Martens (Northeastern University)
  • William E. Byrd (University of Alabama at Birmingham)

Program committee

Joseph P. Near, Evan Donahue, Kristopher Micinski, Max Willsey, Ekaterina Verbitskaia, Gregory Rosenblatt, Weixi Ma, Evgenii Moiseenko, Michael Arntzenius, Adam Foltzer, Emma Tosch.

Scope

Relational programming with emphasis on the miniKanren family. Logic programming, constraint programming, program synthesis, "running programs backwards."

2026 special theme

Relating relational languages – cross-pollinating ideas between miniKanren and proof assistants, solver-aided programming tools, datalog-style languages, equality saturation languages.

Submission tracks

  1. Short papers (2–7 pages, ACM acmsmall format)
  2. Long papers (8–25 pages, ACM acmsmall format)
  3. Double-blind review
  4. Authors encouraged to release code under open-source licenses

Why

ICFP is the annual anchor for typed functional programming research. Two reasons this year matters:

  1. miniKanren workshop. Byrd's relational programming tradition is the logic-programming substrate beneath program synthesis. The 2026 theme on cross-pollination with equality saturation connects directly to the PLDI EGRAPHS workshop – same formal territory, different community.
  2. Equality saturation bridge. Max Willsey (egg/egglog author) on the miniKanren PC creates a direct channel between e-graph rewriting and relational programming. This is the spec-normalization problem from the elenctic-spec side.

Related