Type theory + whales and syntax
☆11Nov 28, 2019Updated 6 years ago
Alternatives and similar repositories for orca
Users that are interested in orca are comparing it to the libraries listed below
Sorting:
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- ☆10May 3, 2017Updated 8 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Jun 11, 2016Updated 9 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- A prototype implementation of the Frank programming language☆17Feb 11, 2016Updated 10 years ago
- wherein I implement several substructural logics in Agda☆24Oct 8, 2018Updated 7 years ago
- Groupoids vs 1-Types☆11Nov 8, 2018Updated 7 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Feb 2, 2019Updated 7 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- An exploration and implementation of the lambda calculus.☆12Oct 18, 2016Updated 9 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- LIMA: Language for Integrated Modeling and Analysis☆12Sep 8, 2018Updated 7 years ago
- ☆26Feb 7, 2017Updated 9 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Jan 1, 2019Updated 7 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- Implementation of a language interpreter in the browser, using js_of_ocaml.☆15Dec 25, 2017Updated 8 years ago
- A formalization of Constructive Projective Geometry in Agda☆12Jun 10, 2019Updated 6 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- Simple lambda prover☆24Jul 6, 2015Updated 10 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 5 years ago
- Talk on generic parallel scan☆14May 12, 2017Updated 8 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Apr 22, 2025Updated 10 months ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- Formal topology (and some probability) in Coq☆31Nov 30, 2018Updated 7 years ago
- Template repo for theorem proving in Liquid Haskell☆32Sep 19, 2018Updated 7 years ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- ET (IPL) language interpreters and literature☆26Feb 15, 2019Updated 7 years ago
- A collection of mechanised proofs☆19Feb 4, 2020Updated 6 years ago
- An higher-level LLVM binding for OCaml☆14Apr 4, 2017Updated 8 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- ☆17Jul 24, 2025Updated 7 months ago
- Semantics for Cryptol☆16Apr 9, 2018Updated 7 years ago
- Fixed length vector for haskell☆21Updated this week
- Translation of Agda code in A. Löh and J. P. Magalhães *Generic Programming with Indexed Functors* to Idris.☆14Apr 5, 2017Updated 8 years ago
- Graphviz code generation with Haskell☆18Jan 26, 2023Updated 3 years ago
- A minimalist implementation of type theory, suitable for experimentation☆15Aug 9, 2025Updated 6 months ago