Alternatives and similar repositories for GDTL-artifact

Users that are interested in GDTL-artifact are comparing it to the libraries listed below

• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• webyrd / curnelo
  Cur dependently-typed language in miniKanren.
  ☆17Updated 7 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• ankitku / TAL0
  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
• gallais / pearl-binary-search
  Functional Pearl: Certified Binary Search in a Read-Only Array
  ☆29Updated 4 years ago
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆25Updated 2 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• pdarragh / parsing-with-zippers-paper-artifact
  The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.
  ☆29Updated last year
• jsiek / arete
  Arete is an experimental programming language.
  ☆12Updated last year
• plum-umd / cgc
  Constructive Galois connections
  ☆35Updated 7 years ago
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated last year
• xieyuheng / cat
  A categorical semantics library in Agda.
  ☆17Updated 5 years ago
• david-christiansen / dan-scheme
  A very little language
  ☆16Updated 2 years ago
• sweirich / lambda-calculus
  Denotational Semantics of the Untyped Lambda Calculus
  ☆17Updated 7 months ago
• gregr / first-order-miniKanren
  miniKanren with a first-order representation of the search space
  ☆17Updated last year
• philnguyen / soft-contract
  A prototype of soft contract verification for an untyped functional language
  ☆35Updated 4 years ago
• jkoppel / ecta
  ☆37Updated last year
• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆16Updated 5 years ago
• wilbowma / experimenting-with-redex
  A Redex tutorial with a focus on how to do work in Redex
  ☆11Updated 11 months ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆48Updated 4 years ago
• jsiek / denotational_semantics
  Denotational semantics based on graph and filter models
  ☆23Updated 9 months ago
• namin / clpsmt-miniKanren
  CLP(SMT) on top of miniKanren
  ☆38Updated 3 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆68Updated 11 years ago
• Kraks / MyPLZoo
  Implementations of various toy programming languages
  ☆12Updated 7 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 9 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• daanx / effect-bench
  Benchmarking algebraic effect handler implementations
  ☆26Updated 4 years ago
• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 7 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆40Updated 4 years ago
• lexi-lambda / racket-mvar
  An implementation of Haskell’s MVars in Racket
  ☆30Updated 11 months ago