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.
☆12Updated 4 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:
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- An Agda formalisation of the theory of directed containers☆12Updated 4 months ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- ☆17Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months 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
- ☆18Updated 3 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago