arXiv (All)
open access
Unit: a type checker for dependent type theory
We present Unit, a type checker for dependent type theory with a module system in the tradition of Automath and a uniform treatment of definitions: two uses of a definition are compared by name and arguments before anything is unfolded, and otherwise the definition declared last is opened. There
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- More Powerful Constant Value Checking with SMT Solving#1201329
- Untyped lambda calculus with functionally referable environments#1460461
- Type, Ability, and Effect Systems: Perspectives on Purity, Semantics, and Expressiveness#1198835
- Not Your Usual Type(s): Data contracts as types across languages and engines#373483
- Combining Type Inference and Automated Unit Test Generation for Python#1035299
Record · ID 1457418
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive