☆21Jan 8, 2021Updated 5 years ago
Alternatives and similar repositories for resyn
Users that are interested in resyn are comparing it to the libraries listed below
Sorting:
- ☆146Apr 6, 2022Updated 3 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Aug 8, 2018Updated 7 years ago
- the Dependent Unboxed higher-oRder Intermediate Notation☆14Feb 8, 2022Updated 4 years ago
- Bring fusion to everyone☆14Feb 6, 2020Updated 6 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Feb 15, 2018Updated 8 years ago
- UI experiments for coda☆66Sep 23, 2021Updated 4 years ago
- Austin's supercompiler work☆21Nov 17, 2019Updated 6 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆64Jul 19, 2025Updated 8 months ago
- Haskell library to interface with the nix package manager☆25Nov 23, 2021Updated 4 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- Derive editors for data types.☆29Oct 5, 2014Updated 11 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Jun 22, 2021Updated 4 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22May 20, 2021Updated 4 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- A PLT Redex implementation of Featherweight Java☆17Oct 8, 2012Updated 13 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Jan 25, 2013Updated 13 years ago
- Efficient parser combinators for Haskell☆39Nov 25, 2025Updated 3 months ago
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated 2 months ago
- high-resolution performance benchmarking☆26Mar 8, 2026Updated 2 weeks ago
- A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.☆21Nov 26, 2023Updated 2 years ago
- HTTP proxy for authenticating users via OAuth2☆10Sep 6, 2019Updated 6 years ago
- Fast unboxed references for ST and IO monad☆15Jul 17, 2017Updated 8 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- Idris, but it's C☆24May 25, 2018Updated 7 years ago
- A simple interface for generating persistent data and linking its dependencies☆48Mar 15, 2026Updated last week
- Simple testing toolkit☆10May 28, 2021Updated 4 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- Haskell bindings to ArrayFire☆60Dec 14, 2024Updated last year
- ☆16Feb 18, 2025Updated last year
- A toy compiler based on SPJ's "The Implementation of Functional Programming Languages"☆25Jun 9, 2024Updated last year
- Streaming parsers collection☆17Jun 19, 2020Updated 5 years ago
- Idris tactics for (commutative) monoids☆20May 24, 2020Updated 5 years ago
- Runtime compilation and invocation of C.☆10Mar 25, 2019Updated 6 years ago
- Haskell bindings to Halide☆20Mar 18, 2024Updated 2 years ago
- A nullary type class for partial functions☆15Nov 28, 2017Updated 8 years ago
- A RWS like monad without the slow writer stuff☆12Jun 17, 2023Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago