orca-lang / orca
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
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- System F implemented in Haskell☆24Updated 12 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 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 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 2 months ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 7 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- Translation of Agda code in A. Löh and J. P. Magalhães *Generic Programming with Indexed Functors* to Idris.☆14Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆48Updated last month
- 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
- ☆14Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Dependently typed elimination functions using singletons☆28Updated last month
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Concurrent IO language with Uniqueness Types☆9Updated 9 years ago
- SML implementation of System T from PFPL.☆11Updated 7 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago