A Word Sampler for Well-Typed Functions
Abstract
We describe an exact sampler for a simply-typed, first-order functional programming language. Given an acyclic finite automaton, α, it samples a random function uniformly without replacement from well-typed functions in L(α). This is achieved via a fixed-parameter tractable reduction from a syntax-directed type system to a context-free grammar, preserving type soundness and completeness w.r.t. L(α), while retaining the robust metatheory of formal languages.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.