bjpop / ministg
Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
☆72Updated 5 years ago
Alternatives and similar repositories for ministg:
Users that are interested in ministg are comparing it to the libraries listed below
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 8 months ago
- ☆45Updated 3 years ago
- Generic functions for single-sorted first-order structural unification☆42Updated last week
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- being bits and pieces I'm inclined to leave lying around☆49Updated 4 months ago
- Layout data in grids and pretty tables. Provides a lot of tools to get the cell formatting right (positional alignment, alignment on spec…☆39Updated 8 months ago
- Generic data types in Haskell, utilities for GHC.Generics☆45Updated 3 months ago
- Where my everyday research happens☆52Updated 3 weeks ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- A GHC plugin and library for analysing GHC Core☆54Updated 2 months ago
- Generic random generators☆81Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- rewrite rules for type-level equalities☆62Updated 11 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- ICFP tutorial☆39Updated 3 years ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- Fine-grained lattice primitives for Haskell☆37Updated 2 months ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated last month
- Literature review of GHC's Core language, System FC☆66Updated 6 years ago
- Proposals for the Haskell Ecosystem☆51Updated 6 years ago
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆72Updated 2 weeks ago
- Mirror of ghc repository. DO NOT SUBMIT PULL REQUESTS HERE☆24Updated 6 years ago
- JHC Haskell compiler split into reusable components☆58Updated 6 years ago
- ☆45Updated 5 years ago
- Normalise GHC.TypeLits.Nat equations☆43Updated last month
- Ghosts of Departed Proofs☆60Updated 4 years ago