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 4 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.☆86Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 2 weeks ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- ICFP 2020 papers. Crowd-sourced☆90Updated 5 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 7 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 7 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- A prototype programming language for programming with runners☆92Updated 4 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- An enhanced unification algorithm for Coq☆58Updated 2 months ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 5 months ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 3 weeks ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago