MrChico / Reals-in-agdaLinks
Constructive definition of real numbers implemented in agda.
☆10Updated 9 years ago
Alternatives and similar repositories for Reals-in-agda
Users that are interested in Reals-in-agda are comparing it to the libraries listed below
Sorting:
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Relative Monad Library for Agda☆24Updated 6 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
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Mtac in Agda☆28Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- Formalizing nbe in agda☆31Updated 12 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- ☆16Updated 3 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- ☆12Updated 6 years ago