bobatkey / foveranLinks
A Dependently Typed Programming Language
☆27Updated 4 years ago
Alternatives and similar repositories for foveran
Users that are interested in foveran are comparing it to the libraries listed below
Sorting:
- A simple implementation of linear type theory☆38Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- secret project☆17Updated 7 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 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
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last week
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- OCaml backend for Idris2☆19Updated 4 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Session types in Idris2!☆27Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago