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☆36Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Collaborative work on reversible computing☆18Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated last month
- Generalized syntax & semantics for universe hierarchies☆32Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- Quasi-quoting library for agda☆18Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 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
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 years ago
- Miller/pattern unification in Agda☆67Updated last month
- Logical relations proof in Agda☆27Updated 10 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago