maxsnew / modal-scheme
A Scheme-like CBPV language with Racket Interoperability
☆39Updated last year
Alternatives and similar repositories for modal-scheme:
Users that are interested in modal-scheme are comparing it to the libraries listed below
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Racket bindings for Z3☆24Updated 5 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 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
- The Prettiest Printer☆34Updated last year
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 8 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- A very little language☆16Updated last year
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 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
- Denotational Semantics of the Untyped Lambda Calculus☆16Updated 2 months ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- A TODO list feature for DrRacket, like to Agda's goal list but for any language.☆33Updated last year
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- ☆12Updated 10 months ago
- Type theory in type theory☆16Updated 13 years ago
- ☆26Updated 8 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- A prototype of soft contract verification for an untyped functional language☆34Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- ☆11Updated 7 years ago
- The Alms Programming Language☆44Updated 6 years ago