Polymorphic Rewrite Rules: Confluence, Type Inference, and Instance Validation
Polymorphic Rewrite Rules: Confluence, Type Inference, and Instance Validation
复制标题
多态重写规则：汇合、类型推断和实例验证
DOI：
10.1007/978-3-319-90686-7_7
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
M. Hamana
中科院分区：
文献类型：
--
作者：
木本真理究;竹川俊也;打木陸雄;松林和也;竹島由里子;植村誠;藤代一成;M. Hamana
我们提出了一个新的多态重写规则框架，具有谓词来限制其实例。它适用于制定和分析编程语言的基本计算。还给出了类型推断算法和检查多态规则局部汇合性的标准，并通过示例程序计算的检查证明了我们方法的有效性。它包括按需调用演算和 Moggi 的计算 lambda 演算。
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.