jfdm / olaf-langLinks
Adventures in being functional.
☆9Updated 3 years ago
Alternatives and similar repositories for olaf-lang
Users that are interested in olaf-lang are comparing it to the libraries listed below
Sorting:
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Anders: Cubical Type Checker☆24Updated last year
- 🪆 A Staged Type Theory☆35Updated last year
- ☆47Updated 3 weeks ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 9 months ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Organize mathematical thoughts☆20Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- ☆36Updated 3 years ago
- Let's rethink how we interact with Agda☆18Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Hanoi tower in Coq☆26Updated last month
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Session types in Idris2!☆27Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- The Rocq Prover Website☆11Updated this week
- A formalization of System Fω in Agda☆17Updated 4 months ago
- Intrinsic Verification of Formal Grammar Theory☆26Updated this week
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- being bits and pieces I'm inclined to leave lying around☆50Updated 6 months ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- Implementing a small functional language with a combinator based graph-reduction machine☆31Updated last year
- A toy dependent typed language.☆29Updated last week
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated 4 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 6 months ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago