Alternatives and similar repositories for Elementary-Affine-Type-Theory-legacy

Users that are interested in Elementary-Affine-Type-Theory-legacy are comparing it to the libraries listed below

• Soonad / Formality-Net-Animator
  Animations for Elementary-Affine-Net interactions
  ☆11Updated 5 years ago
• VictorTaelin / Elementary-Affine-Core-legacy
  A simple, untyped, terminating functional language that is fully compatible with optimal reductions.
  ☆17Updated 5 years ago
• VictorTaelin / escoc-libs-legacy
  Base Formality libraries
  ☆9Updated 6 years ago
• Soonad / Formality-Haskell
  A Haskell implementation of the Formality language
  ☆18Updated 5 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago
• VictorTaelin / formality-agda-lib-legacy
  Agda libraries relevant to Moonad
  ☆14Updated 6 years ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆25Updated 8 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• Soonad / Formality-C
  An implementation of the Formality language in C
  ☆13Updated 5 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 7 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• VictorTaelin / optimul
  Multiplication on optimal λ-calculus reducers
  ☆22Updated 4 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆53Updated 8 years ago
• pis147879 / PELCR
  Parallel Environment for optimal Lambda Calculus Reduction
  ☆28Updated 2 years ago
• cedille / cedille-cast
  Source files used for the Cedille Cast videos
  ☆12Updated 4 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 2 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 6 months ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• Soonad / Formality-Core
  Specification of the Formality proof and programming language
  ☆41Updated 2 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆35Updated 5 years ago
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 4 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆52Updated 7 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 6 months ago
• Soonad / Moonad
  An upcoming operating system built on Type-Theory
  ☆43Updated 4 years ago
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago