orca-lang / orcaLinks
Type theory + whales and syntax
☆11Updated 5 years ago
Alternatives and similar repositories for orca
Users that are interested in orca are comparing it to the libraries listed below
Sorting:
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- being the materials from my YOW LambdaJam 2016 talk☆10Updated 9 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago
- Translation of Agda code in A. Löh and J. P. Magalhães *Generic Programming with Indexed Functors* to Idris.☆14Updated 8 years ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Concurrent IO language with Uniqueness Types☆9Updated 10 years ago
- ☆31Updated 10 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 6 months ago
- System F implemented in Haskell☆24Updated 13 years ago
- IO using sized types and copatterns☆35Updated 4 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
- Experiments with effect systems☆12Updated 9 years ago