fordsec / racets
Faceted execution in Racket
☆12Updated 6 years ago
Alternatives and similar repositories for racets:
Users that are interested in racets are comparing it to the libraries listed below
- Gallina to Bedrock2 compilation toolkit☆52Updated last week
- A Scheme-like CBPV language with Racket Interoperability☆39Updated 10 months ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Because why wouldn't you want to typeset Coq in Scribble?☆10Updated 5 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆16Updated 2 months ago
- A formalization of the theory behind the mugen library☆19Updated 7 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Lifting Reduction Semantics through Syntactic Sugar☆13Updated 6 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 11 years ago
- being an implementation of the calculus of constructions☆15Updated last year
- Experiments with Realizability in Univalent Type Theory☆17Updated 3 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆23Updated 2 years ago
- A cost-aware logical framework, embedded in Agda.☆59Updated 5 months ago
- ☆12Updated 7 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- A Redex tutorial with a focus on how to do work in Redex☆11Updated 3 months ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 4 months ago
- A very little language☆16Updated last year
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- Implementation of Nuprl's type theory in Coq☆44Updated last month
- A bottom-up approach to a verified implementation of MLTT☆17Updated 2 weeks ago
- Agda to C compiler☆10Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 4 months ago
- ☆21Updated 3 years ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- Racket bindings for Z3☆24Updated 5 years ago