elliottt / dangLinks
A compiler for a strongly typed, haskell-like functional language
☆22Updated 8 years ago
Alternatives and similar repositories for dang
Users that are interested in dang are comparing it to the libraries listed below
Sorting:
- A nullary type class for partial functions☆15Updated 8 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 6 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Dependently typed elimination functions using singletons☆28Updated last month
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Bring fusion to everyone☆14Updated 6 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- An attempt to formalize unix cat in fiat☆11Updated 8 years ago
- Type-level assertion operators☆16Updated 7 years ago
- Austin's supercompiler work☆21Updated 6 years ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 5 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
- Compositional type checking for Haskell☆38Updated 14 years ago
- Experiments with effect systems☆12Updated 9 years ago
- A package exposing a function for generating catamorphisms.☆29Updated 7 years ago
- A monadic interface for DAG construction.☆24Updated 4 years ago
- Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"☆15Updated 8 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- A partial binary associative operator (appendMaybe :: a → a → Maybe a)☆13Updated last year
- Experiments in abstracting definitional interpreters☆16Updated 8 years ago
- 🌋 Idris implementation of patricia tree☆23Updated 5 years ago
- Unpinned byte arrays in GHC haskell☆22Updated 7 years ago
- Roundtrip allows the definition of bidirectional (de-)serialization specifications☆16Updated last year
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Agda-style equational reasoning in Haskell☆54Updated 3 weeks ago
- A package re-exporting the verified subset of containers☆20Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago