Simple examples of higher-order functions and partial function application in XQuery

100%

Simple examples of higher-order functions and partial function application in XQuery

✓ Published0🌍 Public

Last edited Feb 27, 2015

Created on Jun 14, 2014

This example demonstrates higher-order functions and partial application in XQuery 3.0, using code tested with Saxon and Zorba. It shows functions that accept or return other functions, such as `local:pow` returning a function, and the `math:pow#2` built-in being partially applied with `?`. The code also illustrates fold operations (`fold-left`, `fold-right`) and sequence functions (`for-each`, `for-each-pair`, `filter`), applied to string and integer sequences. These snippets highlight how XQuery 3.0 supports functional programming patterns.

AI-generated description

Similar vizzes

Loading thumbnail…

Playing with Higher Order Functions in XQuery

This example demonstrates how higher-order functions in XQuery 3.1 enable function composition for transforming numeric sequences. It shows a square function (`$map-sqr`) that uses the simple map operator (`!`) with `math:pow`, which is then fed into a reversal function (`$pow-rev`) via the `=>` arrow operator. The code applies `fn:reverse` to the input sequence before passing it to the squared map, returning the squares of the reversed order. The rendered output is computed in-memory with no external data source, purely exercising the language’s functional capabilities.

CCliffordAnderson

81% match

Loading thumbnail…

XQDoc Example

XQDoc Example demonstrates how XQuery 3.0 implements recursive functions, using a power-calculation function that repeatedly multiplies an integer by itself. The code defines `local:pow()` with base and recursive cases, invoking it with arguments 2 and 3 to compute 8. The example highlights XQuery's declarative recursion pattern, contrasting with iterative languages. The source is a gist by CliffordAnderson, and the rendering approach is plain text output, as no graphical or external API is employed. The function's documentation comments specify parameters, return types, and an adaptation credit to Michael Kay's StackOverflow answer.

CCliffordAnderson

69% match

Loading thumbnail…

[Power Query] Closures, partial application and cascading parameters

This example demonstrates how Power Query’s M language implements closures and partial application through nested functions. The code defines `addTo` as a function that returns another function, capturing the outer variable `x`. By calling `addTo(5)`, it creates `addToFive`, a closure that retains the value 5 in its scope. When `addToFive(3)` is invoked, the closure evaluates to 8, showing how cascading parameters flow through each layer. The rendering is purely textual, with no external libraries or data sources; the logic itself is the visualization.

HHugoberry

64% match

Loading thumbnail…

[Power Query] Closures, partial application and cascading parameters

This example shows how Power Query applies functional techniques to build a cascading parameter system, where a selection in one step narrows the choices in the next. It demonstrates closures and partial application by defining a function `fn.ts` that takes an initial parameter `x` and returns a second function awaiting `y`, ultimately computing their product. The visualization uses this pattern to drive linked dropdowns or sliders, where the output of one control feeds directly into the next. The code relies on Power Query’s native M language functions for data shaping, with no external libraries, and the rendering approach is not specified in the provided snippet.

HHugoberry

64% match

Loading thumbnail…

Quicksort in XQuery

This visualization compares four XQuery implementations of the quicksort algorithm, each derived from a Haskell reference, to demonstrate functional programming in a query language. It shows how the same recursive sorting logic can be expressed with different XQuery 3.1 features, including `fn:head()`, `fn:tail()`, `position()`, and a random-number generator for permutation. The code uses `local:qsort` functions with `xs:integer*` sequences, and the final example applies the sort to a shuffled list of 1 to 100 generated via `fn:random-number-generator('permute')`. The display highlights syntactical variations, such as explicit `where` clauses versus nested `if` expressions, without altering the core algorithm.

CCliffordAnderson

63% match

Loading thumbnail…

Example of a FLWOR expression

This example demonstrates a FLWOR expression in XQuery, showing how to compute the squares of odd numbers from 1 to 10 and return them in descending order. The data source is an inline numeric range, and the result sequence is produced by iterating with a `for` clause, binding each square with `let`, filtering odd values using a `where` condition, and sorting with `order by` before the final `return`. The code relies on the standard XQuery 3.0 library and its built-in arithmetic operators, with no external APIs or rendering components involved.

CCliffordAnderson

63% match

Loading thumbnail…

Example of Fib

This example contrasts two XQuery 3.1 implementations of the Fibonacci sequence, both computing the 30th term. The first defines a recursive function with a `switch` statement, while the second uses tail recursion with accumulator parameters. Each script uses the `declare function` syntax to expose `local:fib`, returning an `xs:integer` sequence. The example highlights alternative recursion strategies in XQuery, showing how the same mathematical result can be produced through different control-flow patterns without external libraries or visualizations.

CCliffordAnderson

62% match

Loading thumbnail…

Factorial

This example demonstrates the computation of the factorial of 10 using XQuery 3.1. It shows two distinct implementation approaches: a recursive function `local:fac` and a higher-order function `local:hFac` that uses `fn:fold-right` with an anonymous function. The program executes `local:hFac(10)`, which iteratively multiplies values from 1 to 10. The data is not visualized graphically; instead, the output is the numeric result of the calculation. The code relies on XQuery’s built-in type annotations (`xs:int`) and function library, with no external visualization libraries involved.

CCliffordAnderson

61% match