JoeyEremondi / GDTL-artifactLinks
A Gradual Dependently-typed Language
☆14Updated 6 years ago
Alternatives and similar repositories for GDTL-artifact
Users that are interested in GDTL-artifact are comparing it to the libraries listed below
Sorting:
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- Implementations of various toy programming languages☆12Updated 7 years ago
- Arete is an experimental programming language.☆12Updated last year
- A Redex tutorial with a focus on how to do work in Redex☆11Updated 10 months ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Constructive Galois connections☆35Updated 7 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- A very little language☆16Updated 2 years ago
- A categorical semantics library in Agda.☆17Updated 5 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago
- miniKanren with a first-order representation of the search space☆17Updated last year
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Denotational semantics based on graph and filter models☆23Updated 8 months ago
- Generation of abstract binding trees☆28Updated 10 months ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆28Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Racket bindings for Z3☆24Updated 6 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆31Updated 4 years ago
- An implementation of Haskell’s MVars in Racket☆30Updated 10 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 11 months ago
- Optimizing Abstract Abstract Machines☆31Updated 8 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 3 years ago