paf31 / Embedding-a-Full-Linear-Lambda-Calculus-in-HaskellLinks
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
Sorting:
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Typed DSLs for sorting☆19Updated 7 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A collection of proofs for some idris class instances - NOT MAINTAINED☆18Updated 10 years ago
- some "modernized" brouwerian mathematics, inspired by Hancock, Ghani & Pattinson☆8Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months 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
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- ☆17Updated 2 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 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☆14Updated 7 years ago
- Translation of Agda code in A. Löh and J. P. Magalhães *Generic Programming with Indexed Functors* to Idris.☆14Updated 8 years ago
- An attempt to formalize unix cat in fiat☆12Updated 8 years ago
- Generate standalone haddock documentation for a set of packages☆27Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Updated 5 months ago
- ☆23Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- being the materials from my YOW LambdaJam 2016 talk☆10Updated 9 years ago
- Companion code for "Why Dependent Types Matter" paper.☆60Updated 7 years ago
- A Typeable-free implementation of extensible effects☆26Updated 7 years ago
- Formally prove properties of Haskell programs using SBV/SMT.☆45Updated 3 months ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- The proof of undecidability of halting problem, using the model -- WHILE language.☆20Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Lightweight Haskell dynamic loading library originally written by Copyright © 2004 Hampus Ram.☆24Updated 7 years ago
- ☆23Updated 8 years ago
- Category theory and algebra☆28Updated 8 years ago