The examples in this package illustrate how to generate and parse XML data using SAX and DOM parsers. All the examples use the Java API for XML Parsing (JAXP) to access the particular SAX or DOM parser rather than accessing the parsers directly. Detailed instructions for building and running each example are included on the individual example pages.

The XSLToolbox is available for download at ftp://ftp.nist.gov/pub/mel/lubell/xsltoolbox/. The distribution includes the APEX and ATTS XSLT transforms, examples, and the documentation on these web pages.

In this section we'll provide a solution to the following problem: given a real-valued function f which has one real argument, and two endpoints a and b estimate the area of the shape defined by the graphic of the function, the abscissa axis and the end-points.

Differentiating a function at a point yields the slope of the graph of the function at that point. Therefore, a rough first calculation of f'(x) will be obtained by the following function:

A very powerful feature of some FP languages (e.g. Haskell ) is having so called non-strict functions and lazy evaluation. A function f is said to be strict if, when applied to a non-terminating expression, it also fails to terminate. For most programming languages all functions are strict. But this is not so in Haskell. In Haskell if a function does not need a value from its argument, it never gets evaluated. Such kind of function evaluation is called lazy evaluation, and non-strict functions are called "lazy functions", and are said to evaluate their arguments "lazily", or "by need" [10]. With lazy evaluation it becomes possible to operate on infinite data structures. For example,

The same generalised functions exist not only for lists, but also for trees. A tree is defined as a set of node (root) having a labelX, and a set of sub-trees:

The function sum that computes the sum of the elements of a list can be defined as follows:

Let's first consider the Newton-Raphson algorithm for finding square roots. The square root of a number N is computed starting from an initial approximation a0 and successively computing better ones using the rule:

As a starting point, let's define some basic terminology and present examples of the use of higher-order functions in FP. Then, we'll take a first step towards our FP implementation in XSLT by defining the "template reference" data type and demonstrate a simple example of its use.

In this section we provide the XSLT implementation of many of the functions defined in John Hughes paper "Why functional programming matters" [1]. We provide numerous implementations of list-processing functions, and of a very generic tree-folding function and other functions that are based on it. We also demonstrate how lazy evaluation can be simulated in XSLT.

In this section we provide the XSLT implementation of some advanced numerical algorithms by using essentially higher order functions for list processing and list generation. Essentially used in these implementations is a function within , which is passed a list-generator function and a tolerance as parameters. within uses the buildListWhile function with the list-generator passed to it as parameter and with its own controller function, which triggers the stop condition, whenever the difference between the last two generated list elements becomes less than the tolerance parameter eps.

Some simple XSLT examples. 1) Simple transformation using an old IE 5 type style sheet (1-ie.xml) styled with (1-ie.xsl)

Eight XSLT stylesheet examples are included with FileMaker Pro 6, and many
more are available for download at XML Central.

Until now it was believed that although XSLT is based on functional programming ideas, it is not as yet a full functional programming language, as it lacks the ability to treat functions as a first-class data type.

Articles and Examples about XML and XSLT.

This download is from a project I developed for my company's intranet. The application creates html dynamically from generating XML through the scripting object and transforming the result with XSLT.

When you get into XML parsing, it is difficult to get a grasp of how to input and output the XML and XSL texts. This code from the .NET XML expert himself, Dan Wahlin, shows you a number of ways to do it, useful code.

A stupid XSL trick is a use of XSLT for something unusual or amusing for which it wasn't necessarily designed. These tricks are intended for an audience that is learning XSLT and wishes do so by poking around in various less-explored corners. Paper includes three examples with full explanations.

Practical XSLT Examples And Reusable Code

Practical XSLT Examples And Reusable Code.