Aiden01 / opalLinks
A statically-typed programming language that compiles to LLVM bytecode
☆9Updated 5 years ago
Alternatives and similar repositories for opal
Users that are interested in opal are comparing it to the libraries listed below
Sorting:
- A VM written following the Linear Abstract Machine architecture☆22Updated 5 years ago
- Linear algebra formalization in Agda☆16Updated 5 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Efficient parser combinators for Haskell☆39Updated 3 weeks ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Merged into ian repo: https://github.com/seagreen/ian#llvm-in-haskell☆17Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- A two-dimensional parser combinator library.☆41Updated 8 years ago
- A simple, easily embeddable pure-functional language with static typing and row polymorphism.☆10Updated 9 years ago
- ☆26Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- ICFP tutorial☆39Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A usable type system for call by push-value☆33Updated 5 years ago
- Implementation for ICFP 2020 paper☆53Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- A small-step semantics for Core☆9Updated 4 years ago
- First class patterns and pattern matching, using type families☆17Updated 4 years ago
- Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"☆15Updated 7 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- A simple functional programming language.☆21Updated 4 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Updated 3 years ago
- Agda-style equational reasoning in Haskell☆53Updated 2 months ago
- Existential type.☆37Updated 6 months ago