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:
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 7 months ago
- Denotational semantics based on graph and filter models☆23Updated 11 months ago
- Implementations of various toy programming languages☆12Updated 7 years ago
- Logical relation for predicative CC omega with booleans and an intensional identity type☆12Updated 7 months ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 10 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated 2 weeks 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
- Because why wouldn't you want to typeset Coq in Scribble?☆10Updated 6 years ago
- Experiments with Realizability in Univalent Type Theory☆19Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 3 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Logical Relation for MLTT in Coq☆28Updated 2 weeks ago
- Gallina to Bedrock2 compilation toolkit☆65Updated 2 weeks ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- Formalising Turing Machines In Coq (bachelor's thesis)☆12Updated 2 years ago
- haha I'm graduating☆14Updated 4 years ago
- Agda to C compiler☆10Updated 2 months ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- A mechanisation of Wasm in Isabelle.☆30Updated 2 weeks ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 3 years ago
- Offline partial evaluation system for Prolog written using the cogen approach☆21Updated 9 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago