UCSD-PL / kraken

Related projects ⓘ

Alternatives and complementary repositories for kraken

• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 8 years ago
• jonsterling / agda-zipper-machine
  An abstract machine using indexed containers and their zippers
  ☆14Updated 7 years ago
• andreasabel / strong-normalization
  Formalizations of strong normalization proofs
  ☆34Updated 5 years ago
• letouzey / coq-minicalc
  Toy demo of lexing/parsing in Coq
  ☆12Updated 5 years ago
• agda / agda-ocaml
  OCaml backend for Agda
  ☆39Updated 6 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 6 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆32Updated 7 years ago
• tel / ocaml-transducers
  Transducers in OCaml. About as Haskelly as you can manage. Hoping to fix that.
  ☆17Updated 9 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 9 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 6 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆21Updated 5 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 9 years ago
• jashug / FormalizedCompilerAlgorithms
  Formalization in Coq of algorithms used in compilers for the Compiler.org project
  ☆15Updated 5 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆18Updated 6 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 6 years ago
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 7 years ago
• RedPRL / yuujinchou
  👹 A library for hierarchical names and lexical scoping
  ☆25Updated last month
• paf31 / Embedding-a-Full-Linear-Lambda-Calculus-in-Haskell
  Embedding a Full Linear Lambda Calculus in Haskell
  ☆8Updated 9 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
• jozefg / undergraduate-thesis
  A discouraging story.
  ☆15Updated 6 years ago
• ujamjar / hardcaml-zinc
  HardCaml implementation of the OCaml ZINC Abstract Machine
  ☆43Updated 4 years ago
• pigworker / Ohrid-Agda
  being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017
  ☆9Updated 7 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• jonsterling / sml-logical-framework
  Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought
  ☆14Updated 7 years ago
• ahmadsalim / desc-n-crunch
  Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.
  ☆11Updated 5 years ago