Abstract
We present a new framework of polymorphic rewrite rules having predicates to restrict their instances. It is suitable for formulating and analysing fundamental calculi of programming languages. A type inference algorithm and a criterion to check local confluence property of polymorphic rules are also given, with demonstration of the effectiveness of our methodology by examinination of sample program calculi. It includes the call-by-need λ -calculus and Moggi’s computational lambda-calculus.
Cite
CITATION STYLE
Hamana, M. (2018). Polymorphic rewrite rules: Confluence, type inference, and instance validation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10818 LNCS, pp. 99–115). Springer Verlag. https://doi.org/10.1007/978-3-319-90686-7_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
