4 search results - page 1 / 1 » The Relative Complement Problem for Higher-Order Patterns |
AGP
1999
IEEE
13 years 9 months ago
1999
IEEE
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
LICS
2007
IEEE
13 years 11 months ago
2007
IEEE
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
ECML
2006
Springer
13 years 8 months ago
2006
Springer
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
ICSE
2003
IEEE-ACM
14 years 4 months ago
2003
IEEE-ACM
The knowledge required to develop complex software has historically existed in programming folklore, the heads of experienced developers, or buried deep in the code. These locatio...