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
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- machine fusion☆16Updated 6 years ago
- ☆26Updated 8 years ago
- A bare-bones LCF-style proof assistant☆22Updated 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
- Pure Type Systems for Functional Programming☆31Updated 4 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 8 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- A pure subset of Prolog, implemented in Haskell☆31Updated 11 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- ☆22Updated 9 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- IO using sized types and copatterns☆33Updated 4 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 11 years ago
- ☆29Updated 9 years ago
- System F in coq.☆19Updated 10 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 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
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 7 years ago
- QFeldspar: a QDSL front-end for MiniFeldspar☆14Updated 9 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago