A Proof of the Turing-completeness of XSLT and XQuery Stephan Kepser

First Page		Document Content
Date: 2002-05-13 11:35:09 Computability theory Functional languages Recursion Subroutines Theoretical computer science XQuery XSLT Primitive recursive function Stack Computing Computer programming Software engineering		A Proof of the Turing-completeness of XSLT and XQuery Stephan Kepser Add to Reading List Source URL: tcl.sfs.uni-tuebingen.de Download Document from Source Website File Size: 96,33 KB Share Document on Facebook

	Integrating Heterogeneous Data Sources with XML and XQuery G. Gardarin, A. Mensch, T. Tuyet Dang-Ngoc, L. Smit e-XMLMedia, 31 Avenue du Général LeclercBOURG LA REINE, France georges.gardarin@e-xmlmedia.f DocID: 1uPnR - View Document
	AN EXTENSIBLE RULE TRANSFORMATION MODEL FOR XQUERY OPTIMIZATION Rules Pattern for XQuery Tree Graph View Nicolas TRAVERS PRiSM Laboratory, University of Versailles, 45 av des Etats-Unis, Versailles, France Nicolas.Traver DocID: 1ut9j - View Document
	Evaluating XQuery in Mediation architecture a full-XML DocID: 1uisA - View Document
	Choosing between XSLT 2.0 and XQuery 1.0 Michael H. Kay The Simple Answer • XQuery is good at query DocID: 1u6dr - View Document
	2015 IEEE International Conference on Big Data (Big Data) A Scalable Parallel XQuery Processor 1 DocID: 1tGAy - View Document