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
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"☆15Updated 7 years ago
- ScopeT and ScopeH☆13Updated last year
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Haskell Type Level Example Programs☆28Updated 7 years ago
- experiments with pext/pdep and codebruijn syntax☆17Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Existential type.☆37Updated 8 months ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- An interpreted lambda calculus with Algebraic and Recursive Types.☆19Updated 4 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 8 months ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 4 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Updated 4 years ago
- Efficient parser combinators for Haskell☆39Updated last month
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- ☆20Updated last year
- Session Types with Priority in Linear Haskell☆27Updated last year
- 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 5 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago