molikto / mlang
Towards changing things and see if it proofs
☆59Updated 3 years ago
Alternatives and similar repositories for mlang:
Users that are interested in mlang are comparing it to the libraries listed below
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago
- An enhanced unification algorithm for Coq☆56Updated 3 weeks ago
- Unification and type inference algorithms☆125Updated 10 years ago
- The Penn Locally Nameless Metatheory Library☆74Updated last month
- SPLV20 course notes☆108Updated 2 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆31Updated 6 months ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆97Updated 7 months ago
- ☆84Updated 7 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated 3 months ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 6 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Staged push/pull fusion with typed Template Haskell☆59Updated last year
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago