Alternatives and similar repositories for miniLCF:

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

• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 5 months ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• RedPRL / sml-dependent-lcf
  A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!
  ☆16Updated 7 years ago
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 3 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆33Updated 7 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 9 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆22Updated 5 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated last year
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 7 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• gmalecha / coq-printf
  Implementation of sprintf for Coq
  ☆18Updated 4 years ago
• sergei-romanenko / agda-simple-scp
  A simple supercompiler formally verified in Agda
  ☆32Updated 8 years ago
• gergoerdi / generic-syntax
  Library implementation of "Generic description of well-scoped, well-typed syntaxes"
  ☆12Updated 6 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 4 years ago
• IanOrton / cubical-topos-experiments
  Agda code for experimenting with internal models of cubical type theory
  ☆13Updated 6 years ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆17Updated 3 months ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago
• danelahman / Normalization-By-Evaluation
  Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories
  ☆15Updated 11 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago