rudymatela / expressLinks
Dynamically-typed Haskell expressions involving applications and variables.
☆22Updated last year
Alternatives and similar repositories for express
Users that are interested in express are comparing it to the libraries listed below
Sorting:
- Funny little Haskell impl☆18Updated 5 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- A template for idris projects☆11Updated 4 years ago
- A usable type system for call by push-value☆33Updated 6 years ago
- 💧 Liquid Haskell integration for Cabal and Stack☆25Updated 6 years ago
- Rose (n-way) trees with both upwards- (i.e. cached) and downwards-traveling (i.e. accumulating) monoidal annotations.☆16Updated 8 months ago
- Prettyprinting transformers for rainbow parens, precedence, etc.☆16Updated 3 years ago
- Dependently typed elimination functions using singletons☆28Updated last month
- Non-empty Vectors☆26Updated 9 months ago
- ☆23Updated 2 years ago
- Core modules for a blazing fast markup combinator library☆24Updated 8 months ago
- An efficient packed, immutable UTF8-backed Unicode text type for Haskell☆33Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Experiments with effect systems☆12Updated 9 years ago
- Zippers for cofree types☆13Updated 4 years ago
- Benchmarks for numbers: ints, doubles, bignums, rationals, etc.☆20Updated 8 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A Haskell library for compile-time checked literal values, via QuasiQuoters.☆13Updated 4 years ago
- Simplify and render Template Haskell☆18Updated 7 years ago
- LibSSH2 FFI bindings for Haskell☆26Updated 10 months ago
- 🌋 Idris implementation of patricia tree☆23Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- 🛗 Typeclass for monads that can be unlifted to arbitrary base monads☆25Updated 4 years ago