gallais / agdARGSLinks
Dealing with Flags and Options
☆13Updated 4 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
- Two-Level Type Theory☆28Updated 5 years ago
- ☆26Updated 8 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- A pure subset of Prolog, implemented in Haskell☆31Updated 12 years ago
- ☆29Updated 10 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- ☆22Updated 9 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 11 years ago
- Generation of abstract binding trees☆27Updated 10 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- Examples from Introduction to Programming in ATS☆26Updated 10 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 9 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 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 dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 4 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- machine fusion☆16Updated 6 years ago