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.
☆82Updated 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
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- A prototypical dependently typed languages with sized types and variances☆108Updated 2 years ago
- Inline, type safe X86-64 assembly programming in Agda☆68Updated 6 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆58Updated 4 years ago
- An enhanced unification algorithm for Coq☆56Updated last month
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A TACtic library for Agda☆48Updated 8 months ago
- A tutorial on how Agda infers things☆42Updated 4 years ago
- A verified compiler for a lazy functional language☆36Updated 2 weeks ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 10 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 8 months ago