alhassy / next-700-module-systemsLinks
PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
☆81Updated 3 years ago
Alternatives and similar repositories for next-700-module-systems
Users that are interested in next-700-module-systems are comparing it to the libraries listed below
Sorting:
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 6 years ago
- An enhanced unification algorithm for Coq☆56Updated 2 months ago
- ☆36Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆82Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Implementation for ICFP 2020 paper☆53Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 8 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 10 months ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 4 years ago
- A Coq library for parametric coinduction☆49Updated 4 months ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆127Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 7 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆44Updated 2 weeks ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 9 months ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 6 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago