vellvm / ollvm
An higher-level LLVM binding for OCaml
☆14Updated 8 years ago
Alternatives and similar repositories for ollvm:
Users that are interested in ollvm are comparing it to the libraries listed below
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- Formalization of Typed Assembly Language (TAL) in Coq☆17Updated last year
- Experiments in formalizing refinement type systems in Coq☆17Updated 9 years ago
- Template repo for theorem proving in Liquid Haskell☆32Updated 6 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- secret project☆17Updated 7 years ago
- A discouraging story.☆15Updated 6 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- ☆26Updated 8 years ago
- Experimentation project☆16Updated 11 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 4 months ago
- Benchmark repository of polyglot effect handler examples☆23Updated this week
- ModTT in Agda☆11Updated 3 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- The Alms Programming Language☆44Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 6 months ago
- Deciding Presburger arithmetic in agda☆31Updated 2 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- System F in coq.☆19Updated 10 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago