Alternatives and similar repositories for sml-cidre:

Users that are interested in sml-cidre are comparing it to the libraries listed below

• ISANobody / sill
  ☆29Updated 9 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆21Updated 5 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 9 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
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 3 months ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 2 months ago
• robsimmons / abbot
  Generation of abstract binding trees
  ☆27Updated 3 months ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 6 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 3 years ago
• jonsterling / agda-effectful-forcing
  Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…
  ☆12Updated 4 years ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• jonsterling / tt
  secret project
  ☆17Updated 6 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• jonsterling / coq-guarded-computational-type-theory
  ☆21Updated 6 years ago
• maxsnew / synthetic-domain-theory
  Experiment with synthetic domain theory in cubical agda
  ☆14Updated 2 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆22Updated 5 years ago
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 4 years ago
• zinid / delimcc
  Delimited continuations in byte-code and native OCaml
  ☆27Updated 4 years ago
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 7 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆11Updated 6 years ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 2 months ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆33Updated 7 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• gallais / agda-presburger
  Deciding Presburger arithmetic in agda
  ☆31Updated last year
• adrieng / pulsar
  Experimental functional language
  ☆17Updated 2 years ago