Pages that link to "Item:Q800713"

The following pages link to Using circular programs to eliminate multiple traversals of data (Q800713):

Displaying 7 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)
• Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers (Q5166620) (← links)