×

Polymorphic rewrite rules: confluence, type inference, and instance validation. (English) Zbl 1507.68072

Gallagher, John P. (ed.) et al., Functional and logic programming. 14th international symposium, FLOPS 2018, Nagoya, Japan, May 9–11, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10818, 99-115 (2018).
Summary: 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 \({\lambda}\)-calculus and Moggi’s computational lambda-calculus.
For the entire collection see [Zbl 1386.68007].

MSC:

68N18 Functional programming and lambda calculus
68N15 Theory of programming languages
PDFBibTeX XMLCite
Full Text: DOI