alhassy / next-700-module-systems
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
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 7 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆106Updated 2 years ago
- Inline, type safe X86-64 assembly programming in Agda☆67Updated 6 years ago
- A tutorial on how Agda infers things☆40Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- A verified compiler for a lazy functional language☆33Updated this week
- Unification and type inference algorithms☆124Updated 9 years ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- ICFP 2020 papers. Crowd-sourced☆92Updated 4 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆74Updated 3 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated last year
- A Coq library for parametric coinduction☆45Updated 2 weeks ago
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- An enhanced unification algorithm for Coq☆53Updated last week
- IO using sized types and copatterns☆33Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆79Updated 4 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆49Updated 6 months ago
- A TACtic library for Agda☆48Updated 5 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 4 months ago