a simple total pure functional language, eventually to have powerful static checking and optimization
☆33Dec 18, 2025Updated 2 months ago
Alternatives and similar repositories for stand-in-language
Users that are interested in stand-in-language are comparing it to the libraries listed below
Sorting:
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- A nullary type class for partial functions☆15Nov 28, 2017Updated 8 years ago
- Funny little Haskell impl☆18Oct 28, 2020Updated 5 years ago
- Just Build It - a "do what I mean" abstraction for Haskell build tools☆12Jun 8, 2018Updated 7 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- the Dependent Unboxed higher-oRder Intermediate Notation☆14Feb 8, 2022Updated 4 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- Tools for functors from Hask^k to Hask☆23Aug 25, 2019Updated 6 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Jan 25, 2013Updated 13 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Jul 22, 2021Updated 4 years ago
- Small programs with unknown halting status.☆13Jun 7, 2016Updated 9 years ago
- Label dependent dependent session types☆16May 2, 2024Updated last year
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated last month
- Bring fusion to everyone☆14Feb 6, 2020Updated 6 years ago
- Roundtrip allows the definition of bidirectional (de-)serialization specifications☆16Oct 16, 2024Updated last year
- Type-level assertion operators☆16Mar 20, 2018Updated 7 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- An approach to managing composable effects, ala mtl/transformers/extensible-effects/Eff☆24Mar 22, 2018Updated 7 years ago
- used to be something more ambitious, cut scope to just a simple compiler for thesis project☆17Jan 14, 2019Updated 7 years ago
- A hashing-based graph implementation in Haskell☆33Jul 2, 2018Updated 7 years ago
- ☆14Jan 12, 2018Updated 8 years ago
- A categorical semantics library in Agda.☆16Dec 22, 2019Updated 6 years ago
- ICFP Bingo 2017 (Idris edition)☆30Aug 22, 2019Updated 6 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Dec 10, 2017Updated 8 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- A monadic interface for DAG construction.☆24May 11, 2021Updated 4 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Jun 4, 2022Updated 3 years ago
- ☆40Aug 5, 2024Updated last year
- A tool for formally verifying Haskell code in Agda☆28Oct 25, 2016Updated 9 years ago
- A dependent type theory with user defined data types☆47Oct 1, 2021Updated 4 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Frank compiler☆305Apr 23, 2024Updated last year
- ALGT 2.0☆30Dec 23, 2019Updated 6 years ago
- Compositional type checking for Haskell☆38Apr 14, 2011Updated 14 years ago
- Unification and type inference algorithms☆127Feb 21, 2015Updated 11 years ago
- A Teeny Type Theory☆27Jun 4, 2022Updated 3 years ago