On the modularity of deciding call-by-need

DOI10.1007/3-540-45315-6_13MaRDI QIDQ2769431zbMATH OpenFDO

Authors Irène Durand, Aart Middeldorp

Publication date 5 February 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2030/20300199

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• A calculus of open modules: call-by-need strategy and confluence
• Reasoning about call-by-need by means of types
• Decidable call-by-need computations in term rewriting
• Small-step and big-step semantics for call-by-need

Cited in

(3)

• Decidable call-by-need computations in term rewriting
• Modularity in term rewriting revisited
• Decidable call by need computations in term rewriting (extended abstract)

This page was built for publication: On the modularity of deciding call-by-need

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2769431)