Pages that link to "Item:Q1768475"
From MaRDI portal
The following pages link to Using circular programs to deforest in accumulating parameters (Q1768475):
Displaying 7 items.
- Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition (Q385017) (← links)
- Using circular programs to eliminate multiple traversals of data (Q800713) (← links)
- Deaccumulation techniques for improving provability (Q882487) (← links)
- Shortcut fusion rules for the derivation of circular and higher-order programs (Q1929359) (← links)
- Algebraic fusion of functions with an accumulating parameter and its improvement (Q3546049) (← links)
- Manipulating accumulative functions by swapping call-time and return-time computations (Q5398337) (← links)
- Semantics and Pragmatics of New Shortcut Fusion Rules (Q5458435) (← links)