"A Simple Proof for the Turing-Completeness of XSLT and XQuery."

Stephan Kepser (2004)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-17

- view
  - electronic edition @ mulberrytech.com (archived)
- export record
  dblp key:
  - conf/extreme/Kepser04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/extreme/Kepser04
Stephan Kepser:
A Simple Proof for the Turing-Completeness of XSLT and XQuery. Extreme Markup Languages® 2004

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.