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:
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last week
- Unification and type inference algorithms☆125Updated 10 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 5 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- An enhanced unification algorithm for Coq☆56Updated 3 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- A prototype programming language for programming with runners☆91Updated 3 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 3 weeks ago
- ☆84Updated 7 years ago
- ☆48Updated 2 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last week
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago