gallais / agdARGS
Dealing with Flags and Options
☆12Updated 3 years ago
Alternatives and similar repositories for agdARGS:
Users that are interested in agdARGS are comparing it to the libraries listed below
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- ☆26Updated 8 years ago
- Pure Type Systems for Functional Programming☆31Updated 4 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 11 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
- A pure subset of Prolog, implemented in Haskell☆31Updated 11 years ago
- ☆29Updated 9 years ago
- System F in coq.☆19Updated 10 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- ☆22Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- ☆12Updated 5 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 8 years ago
- ☆21Updated 6 years ago
- A collection of mechanised proofs☆16Updated 5 years ago
- An Agda formalisation of the theory of directed containers☆11Updated 13 years ago
- Collaborative work on reversible computing☆25Updated 3 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 7 years ago
- Miller/pattern unification in Agda☆64Updated 11 years ago
- Two-Level Type Theory☆28Updated 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
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago