Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic
☆36May 4, 2018Updated 7 years ago
Alternatives and similar repositories for LNLHaskell
Users that are interested in LNLHaskell are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- ScopeT and ScopeH☆13Aug 3, 2024Updated last year
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated 2 months ago
- A tiny language for teaching and experimenting with Refinement Types☆49Jun 22, 2021Updated 4 years ago
- A tool for formally verifying Haskell code in Agda☆28Oct 25, 2016Updated 9 years ago
- Bring fusion to everyone☆14Feb 6, 2020Updated 6 years ago
- ☆48Jul 5, 2019Updated 6 years ago
- Type-level assertion operators☆16Mar 20, 2018Updated 8 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- Invertible syntax for Scala.☆13Oct 17, 2016Updated 9 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Jul 27, 2019Updated 6 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Jan 3, 2018Updated 8 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Mar 25, 2018Updated 8 years ago
- Lenses in Coq☆17Oct 7, 2022Updated 3 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- Literature review of GHC's Core language, System FC☆67Jun 27, 2018Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- Get a GUI fast in any language under the sea!☆48Jan 31, 2023Updated 3 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆33Oct 22, 2024Updated last year
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- Hash consing for arbitrary Haskell data types☆25Dec 4, 2024Updated last year
- Py.test style assertions in Haskell☆67Jun 16, 2018Updated 7 years ago
- A Haskell library implementing several Paxos-related algorithms☆25Dec 13, 2012Updated 13 years ago
- Implementation of sprintf for Coq☆19Apr 6, 2020Updated 5 years ago
- Derive editors for data types.☆29Oct 5, 2014Updated 11 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Oct 18, 2022Updated 3 years ago
- Verified left pad☆19Apr 14, 2018Updated 7 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40May 24, 2016Updated 9 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Jan 25, 2013Updated 13 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Nov 2, 2019Updated 6 years ago
- Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)☆161Mar 23, 2021Updated 5 years ago
- Combinators for manipulating dependently-typed predicates.☆14Jul 5, 2024Updated last year
- Microsoft Static Driver Verifier Benchmarks☆14Jul 21, 2017Updated 8 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- The Penn Locally Nameless Metatheory Library☆76Mar 26, 2025Updated 11 months ago