Alternatives and similar repositories for Formality-Core:

Users that are interested in Formality-Core are comparing it to the libraries listed below

• VictorTaelin / Elementary-Affine-Type-Theory-legacy
  Minimal, efficient proof language
  ☆14Updated 5 years ago
• Soonad / Moonad
  An upcoming operating system built on Type-Theory
  ☆43Updated 4 years ago
• VictorTaelin / Elementary-Affine-Core-legacy
  A simple, untyped, terminating functional language that is fully compatible with optimal reductions.
  ☆17Updated 5 years ago
• astump / cedilleum-spec
  Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core
  ☆26Updated 5 years ago
• VictorTaelin / absal-rs
  ☆35Updated 6 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆45Updated 3 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆79Updated 11 years ago
• astump / cedille-core-spec
  Specification of the Cedille Core language
  ☆29Updated 4 years ago
• VictorTaelin / ultimate-calculus
  ☆36Updated 3 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 3 years ago
• VictorTaelin / absal-ex
  Absal ex
  ☆56Updated last year
• VictorTaelin / formality-agda-lib-legacy
  Agda libraries relevant to Moonad
  ☆14Updated 5 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆61Updated 5 years ago
• Soonad / Formality-Haskell
  A Haskell implementation of the Formality language
  ☆18Updated 4 years ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆67Updated 7 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆45Updated 5 years ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 2 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 4 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆56Updated 7 months ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• moonad-archive / Formality-JavaScript
  An implementation of the Formality language in JavaScript
  ☆72Updated 5 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆52Updated 2 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆52Updated 6 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆81Updated 3 years ago
• eayus / sirdi
  Package manager for Idris
  ☆35Updated 2 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆55Updated 9 months ago
• evertedsphere / sound-and-complete
  An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
  ☆84Updated 7 years ago
• karroffel / Idris2-Ocaml
  OCaml backend for Idris2
  ☆19Updated 4 years ago