Pages that link to "Item:Q1819572"
From MaRDI portal
The following pages link to Rewriting systems on FP expressions to reduce the number of sequences yielded (Q1819572):
Displayed 6 items.
- Automating the Knuth Bendix ordering (Q751830) (← links)
- Termination by completion (Q757069) (← links)
- Schematization of infinite sets of rewrite rules generated by divergent completion processes (Q1262755) (← links)
- Automatic verification of functional programs (Q4007443) (← links)
- Using transformations in the implementation of higher-order functions (Q4939691) (← links)
- A matching process modulo a theory of categorical products (Q5096201) (← links)