Pages that link to "Item:Q800713"
From MaRDI portal
The following pages link to Using circular programs to eliminate multiple traversals of data (Q800713):
Displaying 13 items.
- Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition (Q385017) (← links)
- Partial parametrization eliminates multiple traversals of data structures (Q1085965) (← links)
- Lazy dynamic-programming can be eager (Q1199883) (← links)
- A strict functional language with cyclic recursive data (Q1355753) (← links)
- A transformation method for dynamic-sized tabulation (Q1892705) (← links)
- Shortcut fusion rules for the derivation of circular and higher-order programs (Q1929359) (← links)
- A positive supercompiler (Q4339016) (← links)
- Traced Premonoidal Categories (Q4460686) (← links)
- The resource constrained shortest path problem implemented in a lazy functional language (Q4880525) (← links)
- (Q5020646) (← links)
- Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers (Q5166620) (← links)
- Linear, bounded, functional pretty-printing (Q5302643) (← links)
- Manipulating accumulative functions by swapping call-time and return-time computations (Q5398337) (← links)
