JoeyEremondi / GDTL-artifact

Related projects: ⓘ

• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆27Updated 3 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated 6 months ago
• jsiek / arete
  Arete is an experimental programming language.
  ☆12Updated 11 months ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 8 years ago
• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆16Updated 4 years ago
• coq-community / dblib
  Coq library for working with de Bruijn indices [maintainer=@KevOrr]
  ☆28Updated 3 years ago
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆23Updated last year
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 3 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 2 years ago
• tov / alms
  The Alms Programming Language
  ☆43Updated 6 years ago
• gregr / first-order-miniKanren
  miniKanren with a first-order representation of the search space
  ☆16Updated last month
• jonsterling / agda-calf
  A cost-aware logical framework, embedded in Agda.
  ☆52Updated last month
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• webyrd / curnelo
  Cur dependently-typed language in miniKanren.
  ☆17Updated 6 years ago
• agda / ooAgda
  Interactive and object-oriented programming in Agda using coinductive types
  ☆22Updated 4 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• conal / talk-2020-calculating-compilers-categorically
  A talk
  ☆28Updated 3 years ago
• lamdu / lamdu-calculus
  An extended typed Lambda Calculus
  ☆20Updated last month
• jsiek / denotational_semantics
  Denotational semantics based on graph and filter models
  ☆17Updated last year
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated last year
• herbie-fp / regraph
  Racket Equivalence Graph Library
  ☆18Updated 2 years ago
• annenkov / two-level
  Two-Level Type Theory
  ☆27Updated 4 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 4 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆21Updated 5 years ago
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆10Updated 5 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆32Updated 7 years ago
• philnguyen / z3-rkt
  Racket bindings for Z3
  ☆24Updated 5 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆25Updated 3 years ago
• maxsnew / synthetic-domain-theory
  Experiment with synthetic domain theory in cubical agda
  ☆14Updated last year