paf31 / Embedding-a-Full-Linear-Lambda-Calculus-in-Haskell
Embedding a Full Linear Lambda Calculus in Haskell
☆8Updated 9 years ago
Alternatives and similar repositories for Embedding-a-Full-Linear-Lambda-Calculus-in-Haskell:
Users that are interested in Embedding-a-Full-Linear-Lambda-Calculus-in-Haskell are comparing it to the libraries listed below
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Typed DSLs for sorting☆19Updated 7 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- ☆23Updated 7 years ago
- ☆17Updated 2 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- A collection of proofs for some idris class instances - NOT MAINTAINED☆18Updated 9 years ago
- A Dependently Typed Programming Language☆27Updated 4 years ago
- Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff☆13Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- some "modernized" brouwerian mathematics, inspired by Hancock, Ghani & Pattinson☆8Updated 9 years ago
- A simple XML module for Idris.☆13Updated 4 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
- The proof of undecidability of halting problem, using the model -- WHILE language.☆20Updated 4 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- ☆33Updated 10 years ago
- Experimental C++11 backend for Idris☆14Updated 10 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being the materials from my YOW LambdaJam 2016 talk☆10Updated 8 years ago
- Formalizations of strong normalization proofs☆35Updated 5 years ago
- An exploration and implementation of the lambda calculus.☆12Updated 8 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- System POSIX bindings for Idris.☆36Updated 6 years ago