Beluga-lang / Meta
Mechanizing Types and Programming Languages using Beluga
☆17Updated 4 years ago
Alternatives and similar repositories for Meta:
Users that are interested in Meta are comparing it to the libraries listed below
- ☆17Updated 6 years ago
- Mtac in Agda☆28Updated 3 years ago
- ☆18Updated 2 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 7 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated this week
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- Stable sort algorithms and their stability proofs in Coq☆22Updated 4 months ago
- System F in coq.☆19Updated 9 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Deciding Presburger arithmetic in agda☆31Updated last year
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Experimental normalisation via scheme☆12Updated 3 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- ☆11Updated 4 years ago