Laemmel, Ralf and Thompson, Simon and Kaiser, Markus (2008) Programming errors in traversal programs over structured data. In: 8th Workshop on Language Description, Tools and Applications.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
Traversal strategies provide an established means of describing automated queries, analyses, transformations, and other non-trivial computations on deeply structured data (including, most notably, data representations of software artifacts such as programs). The resulting traversal programs are prone to programming errors. We are specifically concerned with errors that go beyond classic type errors, in particular: (i) divergence of traversal, (ii) unintentional extent of traversal into data, (iii) trivial traversal results, (iv) inapplicability of the constituents of a traversal program along traversal. We deliver a taxonomy of programming errors, and start attacking some of them by refinements of traversal programming.
|Item Type:||Conference or workshop item (Paper)|
|Uncontrolled keywords:||Traversal strategies, Traversal programming, Term rewriting, Stratego, Strafunski, Generic programming, Scrap Your Boilerplate, Type systems, Static program analysis.|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||29 Mar 2010 12:09|
|Last Modified:||29 Mar 2010 12:09|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/23961 (The current URI for this page, for reference purposes)|
- Depositors only (login required):