gallais / agdARGSLinks
Dealing with Flags and Options
☆13Updated 3 years ago
Alternatives and similar repositories for agdARGS
Users that are interested in agdARGS are comparing it to the libraries listed below
Sorting:
- Pure Type Systems for Functional Programming☆31Updated 4 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- machine fusion☆16Updated 6 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
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- ☆26Updated 8 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- Examples from Introduction to Programming in ATS☆26Updated 10 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- ☆29Updated 9 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago
- ☆21Updated 7 years ago
- ☆22Updated 9 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- ☆60Updated 6 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Collaborative work on reversible computing☆25Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Generation of abstract binding trees☆28Updated 8 months ago