Polymorphic rewrite rules: confluence, type inference, and instance validation

DOI10.1007/978-3-319-90686-7_7OpenAlexW2802248566MaRDI QIDQ1648875

Makoto Hamana

Publication date: 9 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-90686-7_7

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Related Items (5)

How to prove decidability of equational theories with second-order computation analyser SOL ⋮ The untyped computational \(\lambda \)-calculus and its intersection type discipline ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Theory and practice of second-order rewriting: foundation, evolution, and SOL

This page was built for publication: Polymorphic rewrite rules: confluence, type inference, and instance validation