
XDuce
 Referenced in 54 articles
[sw12436]
 language. XDuce is a statically typed programming language for XML processing. Its basic data values ... documents, and its types (socalled regular expression types) directly correspond to document schemas. XDuce ... also provides a flexible form of regular expression pattern matching, integrating conditional branching, tag checking ... foundations in the theory of regular tree automata, and present a complete formal definition...

Tree Automata
 Referenced in 3 articles
[sw28835]
 formalization of the class of treeregular languages and its closure properties under set operations...

LETHAL
 Referenced in 2 articles
[sw09918]
 supports a great variety of regular tree language operations and property evaluations. More advanced concepts ... tree automata is to examine regular languages of trees, which are specially constructed sets...

YakYak
 Referenced in 2 articles
[sw07540]
 YakYak: Parsing with logical side constraints Programming language syntax is often described by means ... logic for specifying constraints that are regular tree languages. Concise formulas about the parse tree...

OPTRAN
 Referenced in 3 articles
[sw36324]
 level language for the specification of attributed abstract syntax trees (AASTs) and tree transformations ... syntax tree is described by a regular tree grammar. The transformation of AASTs ... problems in compiler writing: machineindependent optimizations, languagebased editors, sourcetosource translations. OPTRAN...

biXid
 Referenced in 9 articles
[sw12667]
 this relation. Our contributions here are specific language features for facilitating realistic conversions whose target ... details. Concretely, we (1) adopt XDucestyle regular expression patterns for describing and analyzing ... input document to an intermediate “parse tree” structure and the “unparsing” phase that transforms...

MORPHIX
 Referenced in 2 articles
[sw32880]
 morphological regularities of these languages to define a finegrained wordclassspecific subclassification. Morphological ... means of simple operations on nary trees. This approach has been implemented...

PLSMC
 Referenced in 1 article
[sw14776]
 formal specification languages for existing model checking tools such as computation tree logic ... powerful enough to describe $omega$regular properties, in which those properties cannot be verified...

Codatatype
 Referenced in 1 article
[sw28678]
 alphabet. Each node in such a tree indicates whether the path to this node constitutes ... language. This codatatype is isormorphic to the set of lists representation of languages, but caters ... definitions by corecursion and proofs by coinduction. Regular operations on languages are then defined...

BPMPD
 Referenced in 41 articles
[sw00088]
 BPMPD is a stateoftheart implementation...

CGAL
 Referenced in 384 articles
[sw00118]
 The goal of the CGAL Open Source Project...

CoCoA
 Referenced in 654 articles
[sw00143]
 CoCoA is a system for Computations in Commutative...

Coq
 Referenced in 1880 articles
[sw00161]
 Coq is a formal proof management system. It...

COSTA
 Referenced in 24 articles
[sw00162]
 COSTA is a research prototype which performs automatic...

FGb
 Referenced in 247 articles
[sw00286]
 FGb/Gb libraryGb is a program (191 420 lines...

GAP
 Referenced in 3154 articles
[sw00320]
 GAP is a system for computational discrete algebra...

gfun
 Referenced in 144 articles
[sw00344]
 The gfun package provides tools for determining and...

gmp
 Referenced in 282 articles
[sw00363]
 GMP is a free library for arbitrary precision...

Isabelle
 Referenced in 698 articles
[sw00454]
 Isabelle is a generic proof assistant. It allows...