Transformation of structure-shy programs with application to XPath queries and strategic functions

Cunha, Alcino; Visser, Joost

doi:10.1016/j.scico.2010.01.003

Cited by 17 publications

(34 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We hope to eventually gather enough analytical power and strategy properties so that the declarative style of strategic programming can be mapped to highly optimized code. Here, we are inspired by previous work on fusion-like techniques for traversal strategies [6], and calculational techniques for the transformation of traversal strategies [3].…”

Section: Discussionmentioning

confidence: 99%

“…Mentions of simple "laws" for strategies as well as strategy properties can be found scattered over the strategic programming literature [22,6,24,21,9,3]. The present paper provides the first substantial attempt of a systematic discussion of programming errors and their relationship to strategy properties.…”

Section: Related Workmentioning

confidence: 92%

“…Further, we assume a Peano-like definition of the data type for naturals; the Peano-induced recursion will be useful in showcasing a number of programming errors. Here are the data types for naturals and trees: The rewrite rule for incrementing naturals is represented as follows: 3 increment n = Just (Succ n) 3 The use of the constructor Just implies that increment denotes a successful computation.…”

Section: Inventory Of Programming Errorsmentioning

confidence: 99%

“…Automated program calculations based on algebraic laws were devised for specializing (optimizing) strategic programs [3]. For instance, there are laws whose systematic application reveals the "uselessness" of certain subterm traversals in a complete traversal.…”

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

Programming errors in traversal programs over structured data

Lämmel

Thompson

Kaiser

2013

Science of Computer Programming

View full text Add to dashboard Cite

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.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 92%

Section: Inventory Of Programming Errorsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Programming errors in traversal programs over structured data

Lämmel

Thompson

Kaiser

2013

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…After applying the laws of Figs. 4 and 5, we further simplify the resulting expression using a rewrite system similar to one previously developed for the optimization of PF functional expressions [4,18]. Essentially, this rewrite system applies some of the PF laws [11] as unidirectional rewrite rules oriented from left to right.…”

Section: Optimizing Domain and Range Calculationmentioning

confidence: 99%

Relations as Executable Specifications: Taming Partiality and Non-determinism Using Invariants

Macedo

Pacheco

Cunha

2012

Relational and Algebraic Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The calculus of relations has been widely used in program specification and reasoning. It is very tempting to use such specifications as running prototypes of the desired program, but, even considering finite domains, the inherent partiality and non-determinism of relations makes this impractical and highly inefficient. To tame partiality we prescribe the usage of invariants, represented by coreflexives, to characterize the exact domains and codomains of relational specifications. Such invariants can be used as pre-condition checkers to avoid runtime errors. Moreover, we show how such invariants can be used to narrow the non-deterministic execution of relational specifications, making it viable for a relevant class of problems. In particular, we show how the proposed techniques can be applied to execute specifications of bidirectional transformations, a domain where partiality and non-determinism are paramount.

show abstract

Spreadsheet Engineering

and

Batt

2008

Modeling for Insight

View full text Add to dashboard Cite

These tutorial notes present a methodology for spreadsheet engineering. First, we present data mining and database techniques to reason about spreadsheet data. These techniques are used to compute relationships between spreadsheet elements (cells/columns/rows). These relations are then used to infer a model defining the business logic of the spreadsheet. Such a model of a spreadsheet data is a visual domain specific language that we embed in a well-known spreadsheet system. The embedded model is the building block to define techniques for modeldriven spreadsheet development, where advanced techniques are used to guarantee the model-instance synchronization. In this model-driven environment, any user data update as to follow the the model-instance conformance relation, thus, guiding spreadsheet users to introduce correct data. Data refinement techniques are used to synchronize models and instances after users update/evolve the model. These notes briefly describe our model-driven spreadsheet environment, the MDSheet environment, that implements the presented methodology. To evaluate both proposed techniques and the MDSheet tool, we have conducted, in laboratory sessions, an empirical study with the summer school participants. The results of this study are presented in these notes.

show abstract

Transformation of structure-shy programs with application to XPath queries and strategic functions

Cited by 17 publications

References 29 publications

Programming errors in traversal programs over structured data

Programming errors in traversal programs over structured data

Relations as Executable Specifications: Taming Partiality and Non-determinism Using Invariants

Spreadsheet Engineering

Contact Info

Product

Resources

About