著者名,論文名,雑誌名,ISSN,出版者名,出版日付,巻,号,ページ,URL,URL(DOI)
KEPSER S.,A simple proof for the Turing-completeness of XSLT and XQuery,"Proc. Extreme Markup Languages, 2004",,,2004,,,,https://cir.nii.ac.jp/crid/1571417124294859392,