Alternatives and similar repositories for sill:

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

• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• bobatkey / modulog
  A Datalog implementation with an OCaml inspired module system
  ☆44Updated 6 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 2 months ago
• maximedenes / coq-amd64
  ☆22Updated 8 years ago
• robsimmons / abbot
  Generation of abstract binding trees
  ☆27Updated 3 months ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• jmchapman / TT-in-TT
  Type theory in type theory
  ☆16Updated 12 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 7 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 9 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• jonsterling / coq-guarded-computational-type-theory
  ☆21Updated 6 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆22Updated 5 years ago
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆44Updated 2 months ago
• robrix / abstract-interpretation
  Experiments in abstracting definitional interpreters
  ☆16Updated 7 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆21Updated 5 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 6 years ago
• neel-krishnaswami / adjs
  Higher-order FRP compiler
  ☆14Updated 3 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆11Updated 6 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆24Updated 10 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 3 months ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆52Updated 7 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• lastland / WebSpec
  ☆18Updated 7 years ago
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 7 years ago