Manipulating Trees with Hidden Labels

We define an operational semantics and a type system for manipulating semistructured data that contains hidden information. The data model is simple labeled trees with a hiding operator. Data manipulation is based on patternmatching, with types that track the use of hidden labels.

[1]  Benjamin C. Pierce,et al.  XDuce: A Typed XML Processing Language (Preliminary Report) , 2000, WebDB.

[2]  Luca Cardelli,et al.  A Spatial Logic for Querying Graphs , 2002, ICALP.

[3]  Luca Cardelli,et al.  A spatial logic for concurrency (part I) , 2003, Inf. Comput..

[4]  Lus Caires.  A Model for Declarative Programming and Specification with Concurrency and Mobility , 1999 .

[5]  Guido Moerkotte,et al.  Querying documents in object databases , 1997, International Journal on Digital Libraries.

[6]  Andrew D. Gordon,et al.  Ðð Blockinøöóòò Aeóøø× Ò Ìììóööøø Blockin Blockinð Óñôùøøö Ë Blockin , 2007 .

[7]  Mads Dam,et al.  Proof systems for pi-calculus logics , 2002 .

[8]  L. Cardelli,et al.  Querying Trees with Pointers , 2003 .

[9]  C. M. Sperberg-McQueen,et al.  Extensible Markup Language (XML) , 1997, World Wide Web J..

[10]  Jennifer Widom,et al.  The Lorel query language for semistructured data , 1997, International Journal on Digital Libraries.

[11]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[12]  David J. DeWitt,et al.  The Object-Oriented Database System Manifesto , 1994, Building an Object-Oriented Database System, The Story of O2.

[13]  Dan Suciu,et al.  A query language for a Web-site management system , 1997, SGMD.

[14]  Serge Abiteboul,et al.  Object identity as a query language primitive , 1989, SIGMOD '89.

[15]  Andrew M. Pitts,et al.  Nominal Logic: A First Order Theory of Names and Binding , 2001, TACS.

[16]  Peter Buneman,et al.  Semistructured data , 1997, PODS.

[17]  C. M. Sperberg-McQueen,et al.  eXtensible Markup Language (XML) 1.0 (Second Edition) , 2000 .

[18]  François Bancilhon,et al.  Building an Object-Oriented Database System, The Story of O2 , 1992 .

[19]  Andrew M. Pitts,et al.  A new approach to abstract syntax involving binders , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[20]  Andrew D. Gordon,et al.  Notes on Nominal Calculi for Security and Mobility , 2000, FOSAD.

[21]  Luca Cardelli,et al.  A Query Language Based on the Ambient Logic , 2001, SEBD.

[22]  Peter W. O'Hearn,et al.  The Logic of Bunched Implications , 1999, Bulletin of Symbolic Logic.

[23]  Andrew M. Pitts,et al.  A First Order Theory of Names and Binding , 2001 .

[24]  Peter W. O'Hearn,et al.  Local Reasoning about Programs that Alter Data Structures , 2001, CSL.

[25]  Andrew M. Pitts,et al.  A Metalanguage for Programming with Bound Names Modulo Renaming , 2000, MPC.

[26]  Dan Suciu,et al.  A query language and optimization techniques for unstructured data , 1996, SIGMOD '96.

[27]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[28]  François Bancilhon,et al.  The O2 object-oriented database system , 1992, SIGMOD '92.

[29]  Luca Cardelli,et al.  Deciding validity in a spatial logic for trees , 2003, TLDI '03.

[30]  Luca Cardelli,et al.  A Spatial Logic for Concurrency (Part II) , 2002, CONCUR.

[31]  Giuseppe Castagna,et al.  CDuce: an XML-centric general-purpose language , 2003, ICFP '03.

[32]  J W Ballard,et al.  Data on the web? , 1995, Science.

[33]  Luca Cardelli,et al.  Anytime, anywhere: modal logics for mobile ambients , 2000, POPL '00.

[34]  Peter W. O'Hearn,et al.  Computability and Complexity Results for a Spatial Assertion Language for Data Structures , 2001, APLAS.

[35]  Alin Deutsch,et al.  A Query Language for XML , 1999, Comput. Networks.

[36]  Luca Cardelli,et al.  A Spatial Logic for Concurrency , 2001, TACS.