dselsam / tcLinks
Reference type checker for the Lean theorem prover
☆17Updated 7 years ago
Alternatives and similar repositories for tc
Users that are interested in tc are comparing it to the libraries listed below
Sorting:
- Real number computation software☆128Updated 3 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago
- An arbitrary-precision differentiable programming language.☆36Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Miller/pattern unification in Agda☆67Updated last week
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated last year
- HoTT in Lean 3☆82Updated 5 years ago
- ☆47Updated 2 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 weeks ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- Generation of abstract binding trees☆27Updated last month
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- ☆84Updated 8 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Notes and handouts from OPLSS 2019☆34Updated 6 years ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆112Updated 3 months ago
- A verified compiler for a lazy functional language☆37Updated 2 weeks ago