Bottom-Up beta-Reduction: Uplinks and lambda-DAGs
No abstract available.
Related papers
- Shrinking lambda Expressions in Linear Time JFP 1997
- CPS transformation of flow information, Part II: administrative reductions JFP 2003
- A unified approach to fully lazy sharing POPL 2012
- (Optimal) Duplication is not Elementary Recursive POPL 2000
- Parallel Beta Reduction is not Elementary Recursive POPL 1998
- Type Fixpoints: Iteration vs. Recursion ICFP 1999
- Efficient Bottom-Up Synthesis for Programs with Local Variables POPL 2024
- Table Compression for Tree Automata TOPLAS 1991