jacobstanley / ssa-anf
SSA vs ANF
☆42Updated 9 years ago
Alternatives and similar repositories for ssa-anf:
Users that are interested in ssa-anf are comparing it to the libraries listed below
- A deterministic parser with fused lexing☆72Updated last year
- Gallina to Bedrock2 compilation toolkit☆53Updated this week
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- EGraphs in OCaml☆65Updated last year
- A monadic library for symbolic evaluation☆59Updated 3 weeks ago
- Notes on higher-order typed compilation. Probably wrong☆23Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆23Updated 2 years ago
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- Notes and handouts from OPLSS 2018☆54Updated 6 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆55Updated 6 months ago
- Demo for dependent types + runtime code generation☆66Updated last month
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆89Updated 6 years ago
- Experiments about intermediate representations in compilers☆25Updated 12 years ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆50Updated 2 weeks ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago
- A verified compiler for a lazy functional language☆34Updated last month
- An interactive theorem prover based on lambda-tree syntax☆94Updated last month
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated last month
- Deadlock freedom by type checking☆19Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆123Updated 9 months ago
- Implementation of the distillation algorithm as described in the paper "Distillation: Extracting the Essence of Programs".☆27Updated 2 years ago
- Formalization of C++ for verification purposes.☆75Updated last week