Programming Errors in Traversal Programs Over Structured Data

Authors:
Ralf Lämmel;Simon Thompson;Markus Kaiser
Affiliations:
University of Koblenz-Landau;University of Kent;University of Koblenz-Landau
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 19
Cited 1

A new approach to compiling adaptive programs

Science of Computer Programming
Building program optimizers with rewriting strategies

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Visitor combination and traversal control

OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Contracts for higher-order functions

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Scrap your boilerplate: a practical design pattern for generic programming

Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Strategic programming meets adaptive programming

Proceedings of the 2nd international conference on Aspect-oriented software development
Typed Combinators for Generic Traversal

PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
A Strafunski Application Letter

PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
The Theory and Practice of Transforming Call-by-need into Call-by-value

Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming
Influences on the design of exception handling: ACM SIGSOFT project on the impact of software engineering research on programming language design

ACM SIGPLAN Notices
Term rewriting with traversal functions

ACM Transactions on Software Engineering and Methodology (TOSEM)
Traversals of object structures: Specification and Efficient Implementation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Strongly typed heterogeneous collections

Haskell '04 Proceedings of the 2004 ACM SIGPLAN workshop on Haskell
A generic recursion toolbox for Haskell or: scrap your boilerplate systematically

Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
Scrap your boilerplate with XPath-like combinators

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transformation of structure-shy programs: applied to XPath queries and strategic functions

Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Uniform boilerplate and list processing

Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
Type-based termination of generic programs

Science of Computer Programming
Typed contracts for functional programming

FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming

More precise typing of rewrite strategies

Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.