Beluga-lang / MetaLinks
Mechanizing Types and Programming Languages using Beluga
☆21Updated 5 years ago
Alternatives and similar repositories for Meta
Users that are interested in Meta are comparing it to the libraries listed below
Sorting:
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- Mtac in Agda☆28Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- ☆17Updated 7 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- ☆18Updated 3 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆47Updated 4 months ago
- System F in coq.☆19Updated 10 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 8 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- Session types in Idris2!☆27Updated 4 years ago
- A formalization of Constructive Projective Geometry in Agda☆12Updated 6 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago