fordsec / racetsLinks
Faceted execution in Racket
☆12Updated 7 years ago
Alternatives and similar repositories for racets
Users that are interested in racets are comparing it to the libraries listed below
Sorting:
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 7 months ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Gallina to Bedrock2 compilation toolkit☆59Updated last week
- Because why wouldn't you want to typeset Coq in Scribble?☆10Updated 5 years ago
- Implementations of various toy programming languages☆12Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 4 years ago
- Lifting Reduction Semantics through Syntactic Sugar☆13Updated 7 years ago
- Denotational semantics based on graph and filter models☆23Updated 9 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 4 months ago
- Agda to C compiler☆10Updated 2 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- CS410 "Advanced Functional Programming"☆26Updated 4 months ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- ☆13Updated last month
- Formalizations of Gradually Typed Languages in Agda☆57Updated 7 months ago
- Experiments with Realizability in Univalent Type Theory☆18Updated 11 months 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
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- miniKanren with a first-order representation of the search space☆17Updated last year
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Formalising Turing Machines In Coq (bachelor's thesis)☆12Updated 2 years ago
- Racket bindings for Z3☆24Updated 6 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- ☆12Updated last year
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month