grebenyukaa / cmm-compiler-backend
Used libraries: llvm-general, llvm-general-pure - 3.4.2-1; llvm version: 3.4.2-1; Based on http://www.stephendiehl.com/llvm/ solution.
☆7Updated 9 years ago
Related projects: ⓘ
- The generalized intensional compiler for a Haskell-like language.☆14Updated 6 years ago
- An attempt to formalize unix cat in fiat☆12Updated 7 years ago
- Term Rewriting Systems☆17Updated 8 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆11Updated 6 years ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 4 years ago
- ☆20Updated this week
- Austin's supercompiler work☆21Updated 4 years ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 6 years ago
- Educational implementation of dependent types☆19Updated 6 years ago
- ☆12Updated this week
- Types representing line and column positions and ranges in text files☆11Updated last year
- Abstactions and concrete implementations of mutable containers☆14Updated 8 years ago
- Experiments with effect systems☆12Updated 8 years ago
- Typed DSLs for sorting☆19Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Dependent hash maps☆14Updated 3 months ago
- Dependently typed elimination functions using singletons☆27Updated 3 months ago
- A tutorial on writing a concurrency testing tool in Haskell☆13Updated 6 years ago
- A collection of proofs for some idris class instances - NOT MAINTAINED☆18Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- A compiler for a strongly typed, haskell-like functional language☆22Updated 6 years ago
- a parallel, safe, iterative list operation language for systems programming☆16Updated 4 years ago
- A small NuPRL style proof assistant☆32Updated 5 years ago
- van Laarhoven lenses for Idris☆20Updated 6 years ago
- ☆23Updated 7 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆10Updated 5 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 3 years ago
- Examples from Introduction to Programming in ATS☆26Updated 9 years ago
- Derive editors for data types.☆28Updated 9 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago