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:
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- An experimental type checker for a modal dependent type theory.☆114Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 3 weeks ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 5 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- An enhanced unification algorithm for Coq☆56Updated 4 months ago
- being an operating system for typechecking processes☆128Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 3 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 5 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- A prototype programming language for programming with runners☆91Updated 4 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- A verified compiler for a lazy functional language☆37Updated 3 weeks ago
- A tutorial on how Agda infers things☆60Updated last month
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 3 weeks ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- ☆48Updated last week
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago