fordsec / racetsLinks
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
Sorting:
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Logical relation for predicative CC omega with booleans and an intensional identity type☆13Updated 2 months ago
- Lifting Reduction Semantics through Syntactic Sugar☆13Updated 7 years ago
- Agda to C compiler☆10Updated 2 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Denotational semantics based on graph and filter models☆23Updated 6 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Because why wouldn't you want to typeset Coq in Scribble?☆10Updated 5 years ago
- A Redex tutorial with a focus on how to do work in Redex☆11Updated 8 months ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- Quasi-quoting library for agda☆17Updated 6 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated last month
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- ☆15Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ☆12Updated last year
- Experiments with Realizability in Univalent Type Theory☆18Updated 8 months ago
- Gallina to Bedrock2 compilation toolkit☆56Updated this week
- ☆11Updated 3 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 4 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Notes (and implementation) of unification with binders☆14Updated last month
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- ☆13Updated 2 months ago
- ☆16Updated 3 years ago
- NbE course @ Chalmers☆28Updated 9 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago