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
Sorting:
- A deterministic parser with fused lexing☆72Updated last year
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆90Updated 6 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 3 months 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
- Example row-polymorphism implementations☆61Updated last year
- Notes on higher-order typed compilation. Probably wrong☆23Updated 2 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆57Updated 4 years ago
- ☆55Updated last month
- Grab-bag library for the MPL compiler (https://github.com/mpllang/mpl)☆20Updated 2 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Experiments about intermediate representations in compilers☆25Updated 12 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Parallel ML compiler☆72Updated 5 years ago
- Robust multi-prompt delimited control and effect handlers in C/C++☆117Updated last year
- The MLPolyR programming language, revived☆24Updated 4 years ago
- Deadlock freedom by type checking☆20Updated last year
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- MetaML and MetaOCaml bibliography☆89Updated 5 months ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- ☆33Updated 7 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 7 months ago
- a compiler from a lambda language to an assembly language, as a rewrite system☆16Updated last year
- A toy dependent typed language.☆28Updated 3 weeks ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated this week
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago