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
- Unification and type inference algorithms☆124Updated 9 years ago
- A deterministic parser with fused lexing☆72Updated last year
- Gallina to Bedrock2 compilation toolkit☆52Updated this week
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- A monadic library for symbolic evaluation☆58Updated this week
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆89Updated 6 years ago
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 6 years ago
- Notes on higher-order typed compilation. Probably wrong☆23Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Benchmark repository of polyglot effect handler examples☆21Updated 3 months ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆49Updated 8 months ago
- Best of POPL (BOP) Reading Group Memoirs☆67Updated 3 years ago
- Robust multi-prompt delimited control and effect handlers in C/C++☆116Updated last year
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- A verified compiler for a lazy functional language☆33Updated this week
- Experiments about intermediate representations in compilers☆25Updated 12 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated last week
- A compiler for functional programs on serialized data☆158Updated this week
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Parallel ML compiler☆72Updated 4 years ago
- EGraphs in OCaml☆65Updated last year
- An interactive theorem prover based on lambda-tree syntax☆91Updated 2 weeks ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 4 months ago
- Benchmarking various normalization algorithms for the lambda calculus☆44Updated 2 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆22Updated 2 years ago