llvm-hs / llvm-hs-examples
Examples for Haskell bindings to LLVM
☆71Updated 3 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
- A collection of Notes on GHC☆69Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 2 months ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Example language server (LSP) implementation for a toy language☆60Updated 3 years ago
- Hopefully verifiable code generation in GHC☆94Updated 7 years ago
- Library of categories, with categorical constructions on them☆56Updated last year
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated last year
- Simple demonstration stack based virtual machine written in Haskell☆42Updated 8 years ago
- The Software Foundations book, in GHC☆82Updated 2 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- JHC Haskell compiler split into reusable components☆57Updated 6 years ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- Benchmarks for capture-avoiding substitution☆113Updated 3 weeks ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Named parameters (keyword arguments) for Haskell☆94Updated 4 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆80Updated 4 years ago
- Kaleidoscope Tutorial using llvm-hs☆82Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Programming library for Agda☆126Updated 6 months ago
- A language parsing quasiquoter for Haskell based heavily on ANTLR4.☆51Updated 4 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago