A Rewriting Semantics for Type Inference
No abstract available.
Related papers
- Regular language type inference with term rewriting ICFP 2020
- Rewrite rule inference using equality saturation OOPSLA 2021
- An algebraic array shape inference system for MATLAB TOPLAS 2006
- Higher Order Bayesian Networks, Exactly POPL 2024
- Variable Elimination as Rewriting in a Linear Lambda Calculus ESOP 2025
- HoTTSQL: proving query rewrites with univalent SQL semantics PLDI 2017
- On Proving Inductive Properties of Abstract Data Types POPL 1980
- Polyp - A Polytypic Programming Language POPL 1997