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
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆25Updated 2 years ago
• webyrd / curnelo
  Cur dependently-typed language in miniKanren.
  ☆17Updated 7 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.
  ☆23Updated 9 years ago
• plum-umd / cgc
  Constructive Galois connections
  ☆36Updated 7 years ago
• gallais / pearl-binary-search
  Functional Pearl: Certified Binary Search in a Read-Only Array
  ☆29Updated 4 years ago
• philnguyen / soft-contract
  A prototype of soft contract verification for an untyped functional language
  ☆35Updated 4 years ago
• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 8 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• david-christiansen / dan-scheme
  A very little language
  ☆16Updated 2 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 9 years ago
• lexi-lambda / racket-mvar
  An implementation of Haskell’s MVars in Racket
  ☆30Updated last year
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• wilbowma / experimenting-with-redex
  A Redex tutorial with a focus on how to do work in Redex
  ☆11Updated last year
• QuickChick / Luck
  Luck -- A Language for Property-Based Generators
  ☆35Updated 9 months ago
• robsimmons / abbot
  Generation of abstract binding trees
  ☆27Updated 2 months ago
• gregr / first-order-miniKanren
  miniKanren with a first-order representation of the search space
  ☆17Updated last year
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated last year
• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆16Updated 5 years ago
• Kraks / MyPLZoo
  Implementations of various toy programming languages
  ☆12Updated 7 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 10 years ago
• jsiek / denotational_semantics
  Denotational semantics based on graph and filter models
  ☆23Updated last year
• jsiek / arete
  Arete is an experimental programming language.
  ☆12Updated 2 years ago
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 6 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 5 years ago
• wilbowma / scribble-coq
  Because why wouldn't you want to typeset Coq in Scribble?
  ☆10Updated 6 years ago
• rocq-community / dblib
  Coq library for working with de Bruijn indices [maintainer=@KevOrr]
  ☆31Updated 4 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆32Updated 4 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 7 years ago
• annenkov / two-level
  Two-Level Type Theory
  ☆28Updated 6 years ago