bobatkey / foveranLinks
A Dependently Typed Programming Language
☆26Updated 5 years ago
Alternatives and similar repositories for foveran
Users that are interested in foveran are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆36Updated 4 years ago
- A simple implementation of linear type theory☆39Updated 8 years ago
- being an experiment with potato power☆23Updated 6 years ago
- OCaml backend for Agda☆39Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- 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
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- Session types in Idris2!☆27Updated 5 years ago
- Higher-order FRP compiler☆16Updated 4 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 10 months ago
- secret project☆17Updated 7 years ago
- An abstract machine using indexed containers and their zippers☆13Updated 9 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆24Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- System POSIX bindings for Idris.☆36Updated 7 years ago
- A playground for type theory implementations in Racket☆20Updated 10 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- A prototype implementation of the Frank programming language☆17Updated 10 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 3 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- The Alms Programming Language☆44Updated 7 years ago