lexi-lambda / racket-higher-rankLinks
☆21Updated 8 years ago
Alternatives and similar repositories for racket-higher-rank
Users that are interested in racket-higher-rank are comparing it to the libraries listed below
Sorting:
- A playground for type theory implementations in Racket☆20Updated 10 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 8 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- System F in coq.☆19Updated 10 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- The Alms Programming Language☆44Updated 7 years ago
- System POSIX bindings for Idris.☆36Updated 6 years ago
- (Somewhat) Algebraic Data Types for Racket☆34Updated 2 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- An abstract machine using indexed containers and their zippers☆13Updated 8 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆36Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 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
- IO using sized types and copatterns☆36Updated 4 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Type expanders (i.e. type-level functions) for Typed/Racket☆16Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆23Updated 8 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- Invertible parsing for S-expressions☆34Updated 8 months ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 8 years ago
- The Prettiest Printer☆35Updated last year