llvm-hs / llvm-hs-examplesLinks
Examples for Haskell bindings to LLVM
☆73Updated 4 years ago
Alternatives and similar repositories for llvm-hs-examples
Users that are interested in llvm-hs-examples are comparing it to the libraries listed below
Sorting:
- Kaleidoscope Tutorial using llvm-hs☆85Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- Simple demonstration stack based virtual machine written in Haskell☆42Updated 9 years ago
- Programming library for Agda☆130Updated last year
- Tiny type-checker with dependent types☆78Updated 11 years ago
- The Software Foundations book, in GHC☆83Updated 8 months ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- Higher-order optimization library☆76Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- Pretty printer for LLVM AST to Textual IR☆69Updated 2 months ago
- A language based on homotopy type theory with an interval☆83Updated 10 years ago
- Example language server (LSP) implementation for a toy language☆60Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- JHC Haskell compiler split into reusable components☆58Updated 6 years ago
- The Disco Discus Compiler☆174Updated 6 years ago
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- A language parsing quasiquoter for Haskell based heavily on ANTLR4.☆52Updated 4 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Strict Haskell-like programming language that compiles to LLVM☆70Updated 5 years ago
- Simplified Observational Type Theory☆84Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 3 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago