Filters








2,785 Hits in 3.5 sec

A Language of Patterns for Subterm Selection [chapter]

Georges Gonthier, Enrico Tassi
2012 Lecture Notes in Computer Science  
This paper describes the language of patterns that equips the SSReflect proof shell extension for the Coq system.  ...  Patterns are used to focus proof commands on subexpressions of the conjecture under analysis in a declarative manner.  ...  From now on we will always underline with a straight line the subterm selected by the context part of a pattern (i.e., the subterm identified by the bound variable X in the previous example).  ... 
doi:10.1007/978-3-642-32347-8_25 fatcat:5rhj2aecevfdxhok7pinwgsrtm

Pattern-based Subterm Selection in Isabelle [article]

Lars Noschinski, Christoph Traut
2021 arXiv   pre-print
This article presents a pattern-based language designed to select (a set of) subterms of a given term in a concise and robust way.  ...  Building on this language, we implement a single-step rewriting tactic in the Isabelle theorem prover, which removes the need for obscure "occurrence numbers" for subterm selection.  ...  In this article, we present a new language for subterm-selection building upon the ideas of Gonthier and Tassi.  ... 
arXiv:2111.04082v1 fatcat:hkcurusonfaepifxbc6rud7u3m

Xcerpt and visXcerpt [chapter]

Sacha Berger, François Bry, Sebastian Schaffert, Christoph Wieser
2003 Proceedings 2003 VLDB Conference  
Essential to querying semistructured data is the selection of data items in a document (i.e. rooted graph). Most widespread query languages for XML -e.g.  ...  Single (square or curly) braces are used to denote that a matching term must contain matching subterms for all subterms of a term and may not contain additional subterms (total term specification).  ... 
doi:10.1016/b978-012722442-8/50103-8 dblp:conf/vldb/BergerBSW03 fatcat:qkila5rbabawjjte7tm7skqgy4

The XML Query Language Xcerpt: Design Principles, Examples, and Semantics [chapter]

Francois Bry, Sebastian Schaffert
2003 Lecture Notes in Computer Science  
A metaphor for this approach views queries as patterns, answers as data items matching the queries.  ...  XQuery [1], the precursors of XQuery [2], and XSLT [3] -build upon a path-oriented node selection: A node in a data item is specified in terms of a root-to-node path in the manner of the file selection  ...  With this approach, patterns are used not only in construct expressions, but also for data selection. In the following, the basic concepts of a query language called Xcerpt are introduced.  ... 
doi:10.1007/3-540-36560-5_22 fatcat:3kqce3cfbbe7jp23ttqdzmxecu

Higher-order narrowing with definitional trees [chapter]

Michael Hanus, Christian Prehofer
1996 Lecture Notes in Computer Science  
A general completeness result is only provided for terminating rewrite systems due to the lack of an overall theory of higher-order reduction which is outside the scope of this paper. *  ...  Functional logic languages with a sound and complete operational semantics are mainly based on an inference rule called narrowing.  ...  The authors are grateful to the anonymous referees for their detailed comments on a previous version of this paper which were very helpful to improve the readability of the paper.  ... 
doi:10.1007/3-540-61464-8_48 fatcat:xmf4rf4janekvpxafq7dztnpt4

A Visual Language for Web Querying and Reasoning [chapter]

Sacha Berger, François Bry, Sebastian Schaffert
2003 Lecture Notes in Computer Science  
The constructs of the pattern-and rule-based query language Xcerpt are introduced and it is shown how the visual representation visXcerpt renders these constructs to form a visual query language for XML  ...  This article argues that in contrast to the navigational approach taken in particular by XPath and XQuery, a positional approach as used in the language Xcerpt is better suited for a straightforward visual  ...  Navigational Data Selection Essential to querying semistructured data is the selection of data items in a document (i.e. rooted graph). Most widespread query languages for XML -e.g.  ... 
doi:10.1007/978-3-540-24572-8_7 fatcat:omuoazds4ngixkb7zyi5swkaqu

Towards a Declarative Query and Transformation Language for XML and Semistructured Data: Simulation Unification [chapter]

François Bry, Sebastian Schaffert
2002 Lecture Notes in Computer Science  
The growing importance of XML as a data interchange standard demands languages for data querying and transformation.  ...  Then, it is argued that logic programming concepts are particularly appropriate for a declarative query and transformation language for XML and semistructured data.  ...  The authors are thankful to Slim Abdennadher and Norbert Eisinger for useful suggestions.  ... 
doi:10.1007/3-540-45619-8_18 fatcat:axqqv6mmqrbajjkakk3hnrp2fy

Data Retrieval and Evolution on the (Semantic) Web: A Deductive Approach [chapter]

François Bry, Tim Furche, Paula-Lavinia Pătrânjan, Sebastian Schaffert
2004 Lecture Notes in Computer Science  
To make use of data represented on the Semantic Web, it is necessary to provide languages for Web data retrieval and evolution.  ...  This article introduces into the (conventional and Semantic) Web query language Xcerpt and the event and update language XChange, and shows how their deductive capabilities make them well suited for querying  ...  This research has been funded by the European Commission and by the Swiss Federal Office for Education and Science within the 6th Framework Programme project REWERSE number 506779 (cf. http://rewerse.net  ... 
doi:10.1007/978-3-540-30122-6_3 fatcat:77utfeoa2bbnlb3i7rhlrdiubq

Formal validation of pattern matching code

Claude Kirchner, Pierre-Etienne Moreau, Antoine Reilles
2005 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '05  
In this context, our first contribution is to define a general framework for anchoring algebraic pattern-matching capabilities in existing languages like C, Java or ML.  ...  Then, using a just enough powerful intermediate language, we formalize the behavior of compiled code and define the correctness of compiled code with respect to pattern-matching behavior.  ...  We also thank the anonymous referees for valuable comments and suggestions that led to a substantial improvement of the paper.  ... 
doi:10.1145/1069774.1069792 dblp:conf/ppdp/KirchnerMR05 fatcat:tu5a3urof5epjkhycfbiyf5vbq

Evolution of Distributed Web Data: An Application of the Reactive Language XChange

Francois Bry, Michael Eckert, Hendrik Grallert, Paula-Lavinia Patranjan
2007 2007 IEEE 23rd International Conference on Data Engineering  
To respond to the need for evolution and reactivity both locally and globally, the language XChange has been developed.  ...  In this work, we demonstrate its applicability to a concrete scenario of distributed Web sites of a scientific community with mutual data dependencies.  ...  Query terms contain variables for selecting subterms of data terms that are bound to the variables. Accordingly, the result of a query are bindings for the free variables in that query.  ... 
doi:10.1109/icde.2007.369061 dblp:conf/icde/BryEGP07 fatcat:eou5n2yjgvevnjpjc7yetxs2se

Generic techniques for source-level debugging and dynamic program slicing [chapter]

Frank Tip
1995 Lecture Notes in Computer Science  
Specification of an interpreter We illustrate our ideas by way of a simple language L that features assignments, if statements, while statements, and statement sequences.  ...  Algebraic specifications have been used successfully as a formal basis for software development.  ...  Dinesh for their comments on a draft of this paper.  ... 
doi:10.1007/3-540-59293-8_217 fatcat:47ggdh6qhncmrgqilqcrkjwxlm

A compiler for rewrite programs in associative-commutative theories [chapter]

Pierre-Etienne Moreau, Hélène Kirchner
1998 Lecture Notes in Computer Science  
of algebraic programming languages.  ...  The proposed matching method is based on the construction of compact bipartite graphs, and is designed for working very efficiently on specific classes of AC patterns.  ...  Acknowledgements We sincerely thank Peter Borovanský, Claude Kirchner, Christophe Ringeissen, Michaël Rusinowitch and Laurent Vigneron for helpful discussions and comments.  ... 
doi:10.1007/bfb0056617 fatcat:ndigb3gb4bcf5obggorrkjuhcy

Xcerpt and XChange – Logic Programming Languages for Querying and Evolution on the Web [chapter]

François Bry, Paula-Lavinia Pătrânjan, Sebastian Schaffert
2004 Lecture Notes in Computer Science  
A small application scenario is given as a motivation for these languages.  ...  In this article, two deductive languages are introduced: the language Xcerpt, for querying data and reasoning with data on the (Semantic) Web, and the language XChange, for evolution and reactivity on  ...  They are similar to the latter, but augmented by variables (for selecting data items), possibly with variable restrictions using the ; construct (restricting the possible bindings to certain subterms),  ... 
doi:10.1007/978-3-540-27775-0_33 fatcat:iofhnwbz3rgzvfhplgc47cr7w4

A Pattern-Matching Compiler

Pierre-Etienne Moreau, Christophe Ringeissen, Marian Vittek
2001 Electronical Notes in Theoretical Computer Science  
From our experiences, this system is well-suited for industrial use as well as for implementations of rule-based languages.  ...  We present a new tool called mtom for the efficient implementation of rule-based transformations.  ...  Acknowledgements: We would like to thank the referees for their pertinent remarks, Claude Kirchner and Eelco Visser for fruitful discussions on the mtom design and future extensions.  ... 
doi:10.1016/s1571-0661(04)80926-5 fatcat:qhmgw2bptndkfpwkcb2kmwdbhe

Higher-order narrowing with definitional trees

MICHAEL HANUS, CHRISTIAN PREHOFER
1999 Journal of functional programming  
Functional logic languages with a sound and complete operational semantics are mainly based on an inference rule called narrowing.  ...  Needed narrowing is currently the best narrowing strategy for first-order functional logic programs due to its optimality properties w.r.t. the length of derivations and the number of computed solutions  ...  If t| o is a variable, we non-deterministically select a subtree T j , unify t with the pattern of T j (i.e., t| o is instantiated to the constructor of the pattern of T j at position o), and narrow this  ... 
doi:10.1017/s0956796899003330 fatcat:igbn5r5pyrckvbflvtikj7c3j4
« Previous Showing results 1 — 15 out of 2,785 results