gergoerdi / interaction-nets
Haskell implementation of interaction net-based lambda evaluation
☆19Updated 8 years ago
Alternatives and similar repositories for interaction-nets:
Users that are interested in interaction-nets are comparing it to the libraries listed below
- A usable type system for call by push-value☆33Updated 5 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- Bring fusion to everyone☆13Updated 5 years ago
- experiments with pext/pdep and codebruijn syntax☆17Updated 5 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- being a thing I build on a Saturday☆28Updated 6 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- System F implemented in Haskell☆24Updated 12 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 9 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 2 months ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated this week
- An interpreted lambda calculus with Algebraic and Recursive Types.☆18Updated 3 years ago
- Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"☆15Updated 7 years ago
- Linear map categories in Agda☆5Updated last year
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Existential type.☆36Updated 2 months ago
- Physical dimensions and operations☆9Updated 6 years ago