sstucki / f-omega-int-agdaLinks
F-omega with interval kinds mechanized in Agda
☆14Updated last year
Alternatives and similar repositories for f-omega-int-agda
Users that are interested in f-omega-int-agda are comparing it to the libraries listed below
Sorting:
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- Quasi-quoting library for agda☆18Updated 9 months ago
- a version of the 2048 game for Coq☆22Updated last year
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Collaborative work on reversible computing☆18Updated 3 years ago
- ☆12Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆16Updated 3 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☆35Updated 4 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
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 2 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 9 years ago