UCSD-PL / kraken
☆29Updated 10 years ago
Alternatives and similar repositories for kraken:
Users that are interested in kraken are comparing it to the libraries listed below
- Transducers in OCaml. About as Haskelly as you can manage. Hoping to fix that.☆17Updated 9 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Formalizations of strong normalization proofs☆34Updated 5 years ago
- OCaml backend for Agda☆39Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated last month
- Embedding a Full Linear Lambda Calculus in Haskell☆8Updated 9 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆43Updated 2 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- An implementation of Functional Reactive Programming☆40Updated 9 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18Updated 7 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Implementation of sprintf for Coq☆18Updated 4 years ago
- A prototype implementation of the Frank programming language☆17Updated 8 years ago
- Library of Unix effects for Coq.☆23Updated 5 years ago
- System F in coq.☆19Updated 9 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Category theory and algebra☆28Updated 8 years ago
- Bindings to Haskell's IO monad which respect Agda's semantics☆24Updated 6 years ago
- An attempt to formalize unix cat in fiat☆12Updated 7 years ago
- HardCaml implementation of the OCaml ZINC Abstract Machine☆44Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago