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☆44Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 4 months ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 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
- being an operating system for typechecking processes☆125Updated last year
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- The Penn Locally Nameless Metatheory Library☆74Updated 8 months ago
- ☆84Updated 7 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- An enhanced unification algorithm for Coq☆54Updated 2 weeks ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Agda programming with holes☆27Updated 4 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆49Updated 7 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- being the materials for Summer 2013's course☆112Updated last year
- MetaML and MetaOCaml bibliography☆89Updated 3 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago