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 prototypical dependently typed languages with sized types and variances☆113Updated 4 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- ICFP 2020 papers. Crowd-sourced☆90Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 3 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆130Updated last year
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A prototype programming language for programming with runners☆91Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆97Updated last week
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated last month
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 4 months ago
- An enhanced unification algorithm for Coq☆58Updated 7 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Dependently Typed Lambda Calculus in Haskell☆116Updated 4 years ago
- TParsec - Total Parser Combinators in Idris☆96Updated 2 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- A nano "theorem prover".☆62Updated 6 years ago