Alternatives and similar repositories for celf

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

• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆174Updated 7 years ago
• gasche / popl2018-papers
  Link to preprints for POPL'18 and colocated events
  ☆86Updated 7 years ago
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆47Updated 6 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆50Updated 5 years ago
• edwinb / EpiVM
  Epic - a Supercombinator Compiler
  ☆64Updated 10 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆68Updated 11 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆31Updated last year
• mietek / research
  Work in progress
  ☆38Updated 4 months ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• csgordon / cayenne
  Resurrecting Lennart Augustsson's implementation of Cayenne
  ☆37Updated 12 years ago
• pigworker / shonky
  being some experiments, working towards some equipment I wish I had
  ☆37Updated 9 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 9 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• melted / idris-chez
  An idris backend compiling to chez scheme
  ☆48Updated 8 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆51Updated 7 years ago
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆53Updated 6 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆54Updated 8 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• SMLFamily / The-Mechanization-of-Standard-ML
  The Mechanization of Standard ML
  ☆73Updated 3 years ago
• plum-umd / abstracting-definitional-interpreters
  Abstracting Definitional Interpreters
  ☆69Updated 7 years ago
• pnwamk / stop2015-redex
  PLT Redex model of basic Dependently Typed Racket calculus
  ☆18Updated 10 years ago
• mit-plv / timl
  TiML: A Functional Programming Language with Time Complexity
  ☆80Updated 8 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated last year
• tov / alms
  The Alms Programming Language
  ☆44Updated 7 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: …
  ☆111Updated 6 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 10 years ago