First Page | Document Content | |
---|---|---|
Date: 2002-05-13 11:35:09Computability 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 KepserAdd to Reading ListSource URL: tcl.sfs.uni-tuebingen.deDownload Document from Source WebsiteFile Size: 96,33 KBShare Document on Facebook |