molikto / mlangLinks
Towards changing things and see if it proofs
☆60Updated 4 years ago
Alternatives and similar repositories for mlang
Users that are interested in mlang are comparing it to the libraries listed below
Sorting:
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- The Penn Locally Nameless Metatheory Library☆76Updated 9 months ago
- being an operating system for typechecking processes☆130Updated 2 months ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 4 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 5 months ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 9 years ago
- SPLV20 course notes☆114Updated 3 years ago
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 7 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- apkg - package manager for Agda☆38Updated 4 years ago
- Organization and planning for the Initial Types Club☆75Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- mirror of A simple type-theoretic language: Mini-TT☆41Updated 8 years ago
- Benchmarks for capture-avoiding substitution☆121Updated 7 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- Where my everyday research happens☆55Updated 2 weeks ago
- TParsec - Total Parser Combinators in Idris☆99Updated 2 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Efficient Haskell effect handlers based on evidence translation.☆85Updated 4 years ago