Subject: [xsl] [ANN] The interpreter of the Lambda-calculation in XSLT From: "korlyukov" <korlyukov@xxxxxxxxxxxxxx> Date: Sat, 3 Nov 2001 23:51:24 +0200 |
There is the interpreter of the Lambda-calculation in XSLT. For more details, please see http://www.refal.net/~korlukov/lambda/ This program is one more proof, that "XSLT is turing complete". I have 7 examples: Example 1. iszero one Example 2. succ (succ (succ (succ zero ))) Example 3. pred zero Example 4. pred (add (add one one )one ) Example 5. factorial zero Example 6. factorial (add one one ) Example 7. factorial (add (add one one )one ) Times of execution of these examples saxon xt lotusxsl xalan 6.4.3 -j_2_0_0 -j_2_2_D11 1 1.792 0.480 1.983 3.685 2 2.935 0.831 3.024 5.988 3 3.074 0.861 3.264 6.229 4 8.022 2.413 8.092 15.843 5 12.348 3.605 11.296 19.198 6 ------- 27.139 70.592 120.463 7 ------- 47.829 129.246 225.174 Time - Execution time (seconds) without Preparation time. The examples were carried out on the computer with the processor intel Pentium-3, 500 MHz, 256 MB , Windows 2000. Alexandr Korlyukov The professor of the Grodno state university email - korlyukov@xxxxxxxxxxxxxx XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
RE: [xsl] saving nodes for later ou, David Santamauro | Thread | [xsl] ANN: XSLT/XPath and XSLFO Tra, G. Ken Holman |
RE: [xsl] saving nodes for later ou, David Santamauro | Date | [xsl] ANN: XSLT/XPath and XSLFO Tra, G. Ken Holman |
Month |