Alternatives and similar repositories for celf

Users that are interested in celf are comparing it to the libraries listed below

• mmirman / caledon
  higher order dependently typed logic programing
  ☆173Updated 7 years ago
• mietek / research
  Work in progress
  ☆38Updated 6 months ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆57Updated 5 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆66Updated 2 months ago
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆47Updated 6 years ago
• gasche / popl2018-papers
  Link to preprints for POPL'18 and colocated events
  ☆86Updated 7 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆31Updated 2 years ago
• plum-umd / abstracting-definitional-interpreters
  Abstracting Definitional Interpreters
  ☆74Updated 8 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• rocq-community / dblib
  Coq library for working with de Bruijn indices [maintainer=@KevOrr]
  ☆31Updated 4 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• ilya-klyuchnikov / ttlite
  A SuperCompiler for Martin-Löf's Type Theory
  ☆123Updated 3 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 9 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• jonsterling / JonPRL
  An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …
  ☆110Updated 6 years ago
• pnwamk / stop2015-redex
  PLT Redex model of basic Dependently Typed Racket calculus
  ☆18Updated 10 years ago
• sweirich / tal
  An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)
  ☆150Updated 4 years ago
• edwinb / EpiVM
  Epic - a Supercombinator Compiler
  ☆64Updated 10 years ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 8 years ago
• dlicata335 / hott-agda
  ☆85Updated 8 years ago
• ISANobody / sill
  ☆29Updated 10 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆54Updated 8 years ago
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆95Updated 7 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated 2 months ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• dvanhorn / redex-aam-tutorial
  An Introduction to Redex with Abstracting Abstract Machines
  ☆104Updated last year