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 5 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- ☆26Updated 9 years ago
- ☆29Updated 10 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- A pure subset of Prolog, implemented in Haskell☆31Updated 12 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- A simple implementation of linear type theory☆39Updated 8 years ago
- The Alms Programming Language☆44Updated 7 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 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.☆23Updated 9 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 10 years ago
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year
- IO using sized types and copatterns☆36Updated 4 years ago
- being an experiment with potato power☆23Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A tiny implementation of dependent types.☆11Updated 8 years ago
- machine fusion☆16Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- ☆17Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated 3 weeks ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Updated 6 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- System F in coq.☆19Updated 11 years ago