gergoerdi / interaction-netsLinks
Haskell implementation of interaction net-based lambda evaluation
☆21Updated 9 years ago
Alternatives and similar repositories for interaction-nets
Users that are interested in interaction-nets are comparing it to the libraries listed below
Sorting:
- being a thing I build on a Saturday☆28Updated 7 years ago
- A library for doing generic programming in Agda☆35Updated 4 years ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Updated 6 years ago
- Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"☆15Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- experiments with pext/pdep and codebruijn syntax☆17Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- ScopeT and ScopeH☆13Updated last year
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Codo notation for programming with comonads in Haskell☆25Updated 4 years ago
- Dependently typed elimination functions using singletons☆28Updated last year
- Session Types with Priority in Linear Haskell☆27Updated last year
- Provides a type-safe way of working with permutations in Idris☆37Updated 4 years ago
- ☆26Updated 3 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Funny little Haskell impl☆18Updated 5 years ago
- Haskell Type Level Example Programs☆28Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- Efficient parser combinators for Haskell☆39Updated last month
- ☆20Updated last year
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 8 years ago
- An experimental intermediate language for GHC☆36Updated 8 years ago
- being a programming language for sequential circuits☆22Updated 3 weeks ago
- ICFP tutorial☆39Updated 4 years ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 2 weeks ago
- ☆14Updated 7 years ago