UCSD-PL / krakenLinks
☆30Updated 11 years ago
Alternatives and similar repositories for kraken
Users that are interested in kraken are comparing it to the libraries listed below
Sorting:
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Transducers in OCaml. About as Haskelly as you can manage. Hoping to fix that.☆17Updated 10 years ago
- Formalizations of strong normalization proofs☆35Updated 5 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- secret project☆17Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- A discouraging story.☆15Updated 7 years ago
- Embedding a Full Linear Lambda Calculus in Haskell☆8Updated 9 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated last month
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- A Dependently Typed Programming Language☆27Updated 4 years ago
- An attempt to formalize unix cat in fiat☆12Updated 8 years ago
- Category theory and algebra☆28Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- ☆11Updated 4 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Library of Unix effects for Coq.☆23Updated 5 years ago
- 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
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- OCaml back end for Idris☆22Updated 7 years ago
- An implementation of Functional Reactive Programming☆40Updated 10 years ago