67 search results - page 12 / 14 » A Domain-Specific Language for Regular Sets of Strings and T... |
JMLR
2008
13 years 7 months ago
2008
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
PLANX
2008
13 years 8 months ago
2008
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
FPCA
1989
13 years 11 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
CCS
2003
ACM
14 years 19 days ago
2003
ACM
Many network intrusion detection systems (NIDS) use byte sequences as signatures to detect malicious activity. While being highly efficient, they tend to suffer from a high false...