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
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Inline, type safe X86-64 assembly programming in Agda☆68Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆54Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- ☆36Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆74Updated 4 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- ICFP tutorial☆39Updated 3 years ago
- ☆47Updated 3 months ago
- An enhanced unification algorithm for Coq☆54Updated 2 weeks ago
- A TACtic library for Agda☆48Updated 6 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 4 years ago