llvm-hs / llvm-hs-examples
Examples for Haskell bindings to LLVM
☆70Updated 3 years ago
Related projects: ⓘ
- A prototypical dependently typed languages with sized types and variances☆104Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆121Updated last month
- Example language server (LSP) implementation for a toy language☆60Updated 3 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆80Updated 2 years ago
- A language parsing quasiquoter for Haskell based heavily on ANTLR4.☆49Updated 3 years ago
- A language based on homotopy type theory with an interval☆84Updated 9 years ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Hypertypes - generic programming for heterogeneous recursive types☆111Updated last week
- JHC Haskell compiler split into reusable components☆58Updated 5 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆77Updated 8 years ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- Higher-order optimization library☆73Updated last year
- Unification and type inference algorithms☆123Updated 9 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆74Updated 6 years ago
- Named parameters (keyword arguments) for Haskell☆92Updated last year
- Dependently Typed Lambda Calculus in Haskell☆111Updated 3 years ago
- The Software Foundations book, in GHC☆81Updated 3 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆77Updated 4 years ago
- Programming library for Agda☆120Updated 3 weeks ago
- "Modern compiler implementation" in Haskell!☆25Updated 9 years ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 6 years ago
- The Disco Discus Compiler☆174Updated 5 years ago
- Fast parsing from bytestrings☆144Updated 3 weeks ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 7 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 6 years ago
- ☆81Updated 4 months ago
- Kaleidoscope Tutorial using llvm-hs☆81Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆71Updated 4 years ago