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☆45Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- SPLV20 course notes☆112Updated 2 years ago
- apkg - package manager for Agda☆38Updated 4 years ago
- The Penn Locally Nameless Metatheory Library☆75Updated 4 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 9 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆101Updated 10 months ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 2 weeks ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 2 weeks ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- being an operating system for typechecking processes☆128Updated 2 years ago
- Efficient Haskell effect handlers based on evidence translation.☆84Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A formalized proof of a version of the initiality conjecture☆43Updated 4 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Staged push/pull fusion with typed Template Haskell☆59Updated last year
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago
- Cartesian Cubical Type Theory☆71Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago