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
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆23Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- An interactive theorem prover based on lambda-tree syntax☆92Updated 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
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- ☆54Updated 2 weeks ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 3 years ago
- ☆21Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Demo for dependent types + runtime code generation☆66Updated 3 weeks ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated last month
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Experiments about intermediate representations in compilers☆25Updated 12 years ago
- A monadic library for symbolic evaluation☆59Updated 2 weeks ago
- Higher-order optimization library☆74Updated last year
- A compiler for functional programs on serialized data☆158Updated this week
- 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
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated 7 months ago
- Implementation of the distillation algorithm as described in the paper "Distillation: Extracting the Essence of Programs".☆27Updated 2 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆55Updated 5 months ago
- Benchmarks for capture-avoiding substitution☆113Updated 3 weeks ago
- Benchmarking various normalization algorithms for the lambda calculus☆44Updated 2 years ago
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 6 years ago
- A verified compiler for a lazy functional language☆34Updated last month
- A pure type system implemented in OCaml☆78Updated 4 years ago