Sciweavers

133 search results - page 13 / 27
» Recognizing Mathematical Expressions Using Tree Transformati...
Sort
View
124
Voted
BMCBI
2010
137views more  BMCBI 2010»
15 years 2 months ago
TreeGraph 2: Combining and visualizing evidence from different phylogenetic analyses
Background: Today it is common to apply multiple potentially conflicting data sources to a given phylogenetic problem. At the same time, several different inference techniques are...
Ben C. Stöver, Kai F. Müller
133
Voted
CALCO
2009
Springer
176views Mathematics» more  CALCO 2009»
15 years 9 months ago
Complementation of Coalgebra Automata
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
Christian Kissig, Yde Venema
140
Voted
DOCENG
2006
ACM
15 years 8 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda
ICFP
2002
ACM
16 years 2 months ago
Composing monads using coproducts
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
Christoph Lüth, Neil Ghani
125
Voted
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 2 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur