fordsec / racetsLinks
Faceted execution in Racket
☆11Updated 7 years ago
Alternatives and similar repositories for racets
Users that are interested in racets are comparing it to the libraries listed below
Sorting:
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 2 weeks ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Experiments with Realizability in Univalent Type Theory☆19Updated last year
- Implementations of various toy programming languages☆12Updated 7 years ago
- Agda to C compiler☆10Updated 4 months ago
- Because why wouldn't you want to typeset Coq in Scribble?☆10Updated 6 years ago
- A Redex tutorial with a focus on how to do work in Redex☆11Updated last year
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆12Updated 2 months ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Denotational semantics based on graph and filter models☆23Updated last year
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 3 weeks ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated last year
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated 2 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 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
- Collaborative work on reversible computing☆25Updated 4 years ago
- Gallina to Bedrock2 compilation toolkit☆65Updated last week
- Library for Classical Coq☆40Updated 3 weeks ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 3 years ago
- Logical relation for predicative CC omega with booleans and an intensional identity type☆12Updated 9 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- ☆15Updated 6 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last month
- Yet Another deep embedding of Linear Logic in Coq☆16Updated this week