Alternatives and similar repositories for kraken:

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

• jonsterling / agda-zipper-machine
  An abstract machine using indexed containers and their zippers
  ☆14Updated 8 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆33Updated 7 years ago
• andreasabel / strong-normalization
  Formalizations of strong normalization proofs
  ☆34Updated 5 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 8 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 2 months ago
• tel / ocaml-transducers
  Transducers in OCaml. About as Haskelly as you can manage. Hoping to fix that.
  ☆17Updated 10 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 6 years ago
• letouzey / coq-minicalc
  Toy demo of lexing/parsing in Coq
  ☆12Updated 5 years ago
• bobatkey / foveran
  A Dependently Typed Programming Language
  ☆27Updated 4 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• paf31 / Embedding-a-Full-Linear-Lambda-Calculus-in-Haskell
  Embedding a Full Linear Lambda Calculus in Haskell
  ☆8Updated 9 years ago
• agda / agda-ocaml
  OCaml backend for Agda
  ☆39Updated 6 years ago
• jozefg / undergraduate-thesis
  A discouraging story.
  ☆15Updated 6 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
• pedagand / MPRI-2.4-DTP
  MPRI-2.4 Dependently-typed Functional Programming
  ☆32Updated 4 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• ZongzheYuan / HaltingProblem
  The proof of undecidability of halting problem, using the model -- WHILE language.
  ☆20Updated 4 years ago
• agda-attic / agda-system-io
  Bindings to Haskell's IO monad which respect Agda's semantics
  ☆24Updated 6 years ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆28Updated 8 years ago
• coq-io / system
  Library of Unix effects for Coq.
  ☆23Updated 5 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
• mietek / research
  Work in progress
  ☆34Updated 2 months ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 8 years ago
• gmalecha / coq-interaction-trees
  Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.
  ☆17Updated 6 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆24Updated 10 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 7 years ago
• gmalecha / coq-printf
  Implementation of sprintf for Coq
  ☆18Updated 4 years ago
• SimonBoulier / TypingFlags
  A Coq plugin to disable positivity check, guard check and termination check
  ☆16Updated 5 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago