bobatkey / foveranLinks
A Dependently Typed Programming Language
☆27Updated 5 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☆36Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- being an experiment with potato power☆23Updated 5 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- An abstract machine using indexed containers and their zippers☆13Updated 9 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- OCaml backend for Agda☆39Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 8 months ago
- Resources for "One Monad to Prove Them All"☆29Updated 7 years ago
- Generation of abstract binding trees☆27Updated 3 months ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago