Beluga-lang / Meta
Mechanizing Types and Programming Languages using Beluga
☆18Updated 4 years ago
Alternatives and similar repositories for Meta:
Users that are interested in Meta are comparing it to the libraries listed below
- Mtac in Agda☆28Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated this week
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- System F in coq.☆19Updated 10 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Session types in Idris2!☆27Updated 4 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Deciding Presburger arithmetic in agda☆31Updated 2 years ago
- ☆17Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 7 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- MixML prototype interpreter☆27Updated 5 years ago
- ☆18Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Session Types with Priority in Linear Haskell☆26Updated 10 months ago