Elegant elaboration with function invocation
Tesla Zhang
TL;DR
This paper introduces a refined core language design for a dependently-typed lambda calculus, incorporating $\
Contribution
It presents a novel elegant core language design and an elaboration algorithm for dependently-typed lambda calculus.
Findings
Enhanced language expressiveness with $\
Improved elaboration process efficiency
Theoretical validation of the language design
Abstract
We present an elegant design of the core language in a dependently-typed lambda calculus with -reduction and an elaboration algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Logic, Reasoning, and Knowledge · Advanced Database Systems and Queries