<--- Back to Details
First PageDocument Content
Subroutines / Functional programming / Lambda calculus / Anonymous function / Closure / Function / Higher-order function / XSLT / Haskell 98 features / Software engineering / Computing / Declarative programming
Date: 2012-11-17 18:09:06
Subroutines
Functional programming
Lambda calculus
Anonymous function
Closure
Function
Higher-order function
XSLT
Haskell 98 features
Software engineering
Computing
Declarative programming

Implementing Closures in XSLT/XPath 3.0

Add to Reading List

Source URL: www.xfront.com

Download Document from Source Website

File Size: 82,11 KB

Share Document on Facebook

Similar Documents

Pebble / Smartwatches / Mathematical logic / Mathematics / Differential topology / Lie algebras / Moschovakis coding lemma

Closure Under Reversal of Languages over Infinite Alphabets

DocID: 1xW1C - View Document

Mathematics / Algebra / Theoretical computer science / Modular arithmetic / Logic in computer science / Congruence relation / Equivalence / Closure / Rewriting / Congruence lattice problem / Congruence subgroup

Proof-producing Congruence Closure Robert Nieuwenhuis? and Albert Oliveras?? Technical University of Catalonia, Jordi Girona 1, 08034 Barcelona, Spain www.lsi.upc.es/~roberto www.lsi.upc.es/~oliveras Abstract. Many appl

DocID: 1xVT4 - View Document

-2476531115Case Closure/ Transfer (Out) 00Case Closure/ Transfer (Out20

DocID: 1vq8T - View Document

Algebra 2. Teorema di Lindemann-Weierstrass. Roma, version 2017 In this note we present Baker’s proof of the Lindemann-Weierstrass Theorem [1]. Let Q denote the algebraic closure of Q inside C.

DocID: 1vhl6 - View Document

Evaluation of the 1.25" ALPHA CONTINUOUS THREAD CLOSURE ON A ONE GALLON METAL CAN

DocID: 1vhed - View Document