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
- 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.☆33Updated 7 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A TODO list feature for DrRacket, like to Agda's goal list but for any language.☆33Updated last year
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- The Prettiest Printer☆35Updated last year
- Miller/pattern unification in Agda☆64Updated 11 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 9 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Organize mathematical thoughts☆19Updated last year
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 8 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- A very little language☆16Updated last year
- ☆22Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- A Scala-style magic function application form☆43Updated 2 years ago
- ☆21Updated 7 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- (Somewhat) Algebraic Data Types for Racket☆34Updated 2 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 9 years ago
- An equational theorem prover based on Knuth-Bendix completion☆50Updated last week
- A prototype of soft contract verification for an untyped functional language☆34Updated 3 years ago
- ☆12Updated 9 months ago
- Stronger types for a few Typed Racket operators☆11Updated last year
- Type expanders (i.e. type-level functions) for Typed/Racket☆17Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago