XSL is two languages of the XML framework: XSL/FO is for formatting (as more powerful alternative to CSS). XSLT is for transformations.

perl-XML-XSLT - Perl module XML::XSLT: This is a Perl module to parse XSL Transformational sheets

This is a Perl module to parse XSL Transformational sheets.

What is new in FileMaker Pro 6? The best just got better with FileMaker Pro 6 database software. It features digital image capture* and import; more than 20 modern and powerful templates for "instant productivity" in business, education and home; many time-saving features like Format Painter and Custom Dialog Boxes for users and developers; and integrated XML support so FileMaker can exchange data with a large and growing number of other applications.

An interesting thread over at kuro5hin on the tribulations one person had when writing a filter to convert XML documents to LaTeX using XSLT (with examples of how some of the transformations would be handled using Perl or Haskell instead).

Create these two files (below), replacing the data with your own. Examine the syntax and view the file in Internet Explorer 6 and Netscape 7.0. Always check that the code is free of errors (I may accidentally leave typos in my examples, sorry..), the quotes are straight, etc.

Chapter 20 Examples. There are no long examples in this chapter. [
| Previous Chapter | Next Chapter | Examples from Other Chapters ...

XSLT Examples. 1) Converting XML to HTML - XML source - XSLT source. 2)Matching parent-child
elements - XML source - XSLT source.

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:

This week the XML-Deviant looks at a community project, being conducted on the XSL mailing list, which has grown out of the recent concerns and debate over the XSLT 1.1 Working Draft The Beginnings 2001 is certainly turning into an eventful year for the XML community. The new year began with the community-led development of RDDL (see Old Ghosts: XML Namespaces ), and the past month has seen a lot of heated debate over the future directions of many core W3C... Found at XML.com.

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.