jonsterling / agda-effectful-forcingLinks
Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -> nat) in System T.
☆13Updated 5 years ago
Alternatives and similar repositories for agda-effectful-forcing
Users that are interested in agda-effectful-forcing are comparing it to the libraries listed below
Sorting:
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- A dependently typed type checker for a TT with intervals☆24Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- An Agda formalisation of the theory of directed containers☆12Updated 8 months ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- ☆17Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- A playground for type theory implementations in Racket☆20Updated 10 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 3 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- being an experiment with potato power☆23Updated 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
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago