Rewriting systems on FP expressions to reduce the number of sequences yielded

DOI10.1016/0167-6423(86)90017-1zbMath0613.68012OpenAlexW2075624179MaRDI QIDQ1819572

Françoise Bellegarde

Publication date: 1986

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(86)90017-1

zbMATH Keywords

program transformationKnuth-Bendix procedureiterative programsalgebra of functional programsFP programsREVEunnecessary intermediate sequences

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (6)

Automatic verification of functional programs ⋮ A matching process modulo a theory of categorical products ⋮ Using transformations in the implementation of higher-order functions ⋮ Schematization of infinite sets of rewrite rules generated by divergent completion processes ⋮ Automating the Knuth Bendix ordering ⋮ Termination by completion

This page was built for publication: Rewriting systems on FP expressions to reduce the number of sequences yielded