Beluga-lang / MetaLinks
Mechanizing Types and Programming Languages using Beluga
☆18Updated 5 years ago
Alternatives and similar repositories for Meta
Users that are interested in Meta are comparing it to the libraries listed below
Sorting:
- Mtac in Agda☆28Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- Session types in Idris2!☆27Updated 4 years ago
- ☆17Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 weeks 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
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- ☆18Updated 3 years ago
- ☆27Updated 4 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 2 months ago
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Stable sort algorithms and their stability proofs in Coq☆22Updated last month
- Logical relations proof in Agda☆26Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆26Updated 8 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago