Back to Results
First PageMeta Content
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

Document Date: 2002-05-13 11:35:09

Open Document

File Size: 96,33 KB

Share Result on Facebook

/

IndustryTerm

Web Consortium / basic tool / /

Organization

University of T¨ubingen / /

Person

Stephan Kepser / /

Position

straight forward / /

ProgrammingLanguage

XPath / XML / HTML / XSLT / XQuery / /

Technology

HTML / XML / XSLT / /

URL

http /

SocialTag