Elegant elaboration with function invocation
Abstract
We present an elegant design of the core language in a dependently-typed lambda calculus with δ-reduction and an elaboration algorithm.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.