molikto / mlangLinks
Towards changing things and see if it proofs
☆60Updated 3 years ago
Alternatives and similar repositories for mlang
Users that are interested in mlang are comparing it to the libraries listed below
Sorting:
- Cartesian Cubical Type Theory☆71Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 8 months ago
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆99Updated 8 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 6 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- Staged push/pull fusion with typed Template Haskell☆59Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 8 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- TParsec - Total Parser Combinators in Idris☆95Updated last year
- ☆84Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Where my everyday research happens☆53Updated last week
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 3 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Agda programming with holes☆27Updated 4 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- The Penn Locally Nameless Metatheory Library☆74Updated 2 months ago