29 search results - page 6 / 6 » Tree Automata with Memory, Visibility and Structural Constra... |
COLING
1992
13 years 6 months ago
1992
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
AMAST
2010
Springer
13 years 9 days ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
ICFP
2005
ACM
14 years 5 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
ICDM
2009
IEEE
13 years 3 months ago
2009
IEEE
Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited...