Higher-order transformation and the distributed data problem. Page: 5 of 60
This report is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided to UNT Digital Library by the UNT Libraries Government Documents Department.
Extracted Text
The following text was automatically extracted from the image on this page using optical character recognition software:
Contents
1 Introduction
1.1 Contribution . . . . . . . . . . . . .
1.2 O utline . . . . . . . . . . . . . . . .
2 Motivation
2.1 Phase I: The Creation of Data . . .
2.2 Phase II: The Binding of Data . . .
2.3 Phase III: The Distribution of Data
2.4 Phase IV: The Use of Data . . . . .
2.5 Examples . . . . . . . . . . . . . . .
2.5.1 Type Checking . . . . . . . .
2.5.2 Variable Renaming . . . . . .
2.5.3 General Replacements . . . .
2.5.4 Closure Conversion . . . . . .
2.6 Questions and Concerns . . . . . . .
3 Running Example
3.1 The Table Normalization Problem
3.1.1 A Higher-Order Solution . . .
3.1.2 A First-Order Solution . . . .3.2 Generalization to a Higher-Order Strategic Framework . . .
4 Model
4.1 Trees..... ...............................
4.2 Match Equations . . . . . . . . . . . . . . . . . . . . . . . .
4.3 Conditional Rewrite Rules . . . . . . . . . . . . . . . . . . .
4.4 The Syntax of TL Strategies . . . . . . . . . . . . . . . . . .
4.5 The Semantics of TL . . . . . . . . . . . . . . . . . . . . . .
4.5.1 The Application of Conditional Rewrite Rules . . . .
4.5.2 Choice and Observing the Application of a Strategy
4.5.3 The Semantics of Basic Strategic Combinators . . .4.5.4
4.5.5
4.5.6
4.5.7
4.5.8
4.5.9
4.5.10The Semantics of First-Order Generic Traversal Combinators . . . .
The Semantics of Higher-Order Generic Traversal Combinators . . .
Coda ....... ....................................
Non-recursive and Recursive Strategy Definitions . . . . . . . . . . .
Some Generic Recursive TL Strategies . . . . . . . . . . . . . . . . .
Some Generic Higher-Order Strategies in TL . . . . . . . . . . . . .
A TL Implementation of Some Standard First-Order Generic Strategies5
8
9
. . . 1010
11
12
12
13
13
13
14
15
15
16
17
18
20
21
21
22
22
24
25
25
26
26
27
30
31
32
33
34
36
37
38. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
Upcoming Pages
Here’s what’s next.
Search Inside
This report can be searched. Note: Results may vary based on the legibility of text within the document.
Tools / Downloads
Get a copy of this page or view the extracted text.
Citing and Sharing
Basic information for referencing this web page. We also provide extended guidance on usage rights, references, copying or embedding.
Reference the current page of this Report.
Winter, Victor Lono (University of Nebraska at Omaha, Omaha, NE) & Subramaniam, Mahadevan (University of Nebraska at Omaha, Omaha, NE). Higher-order transformation and the distributed data problem., report, December 1, 2003; United States. (https://digital.library.unt.edu/ark:/67531/metadc877481/m1/5/: accessed April 23, 2024), University of North Texas Libraries, UNT Digital Library, https://digital.library.unt.edu; crediting UNT Libraries Government Documents Department.