bobatkey / sott

Related projects ⓘ

Alternatives and complementary repositories for sott

• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆69Updated 2 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆52Updated 5 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆64Updated 3 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆70Updated 5 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆104Updated last year
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆76Updated 10 years ago
• slindley / effect-handlers
  ☆80Updated 6 months ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated last year
• gallais / potpourri
  Where my everyday research happens
  ☆53Updated 2 months ago
• frex-project / idris-frex
  ☆46Updated last month
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆122Updated 3 months ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆79Updated 11 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆123Updated 9 years ago
• coq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆52Updated last month
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆122Updated 5 months ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆29Updated last year
• jespercockx / ataca
  A TACtic library for Agda
  ☆48Updated last month
• pedagand / MPRI-2.4-DTP
  MPRI-2.4 Dependently-typed Functional Programming
  ☆32Updated 3 years ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆51Updated 2 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 2 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• lambda-pi-plus / lambda-pi-plus
  A simple Depdently-Typed Language for Research and Learning
  ☆58Updated 8 years ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆105Updated 9 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆46Updated 5 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 7 months ago
• coq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆42Updated 10 months ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 7 years ago