441 search results - page 26 / 89 » A Method for Proving Observational Equivalence |
137
click to vote
JCT
1998
15 years 5 months ago
1998
If t is a positive integer, then a partition of a non-negative integer n is a t−core if none of the hook numbers of the associated Ferrers-Young diagram is a multiple of t. These...
184
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
155
Voted
APLAS
2007
ACM
15 years 9 months ago
2007
ACM
Pattern matching makes ML programs more concise and readable, and these qualities are also sought in object-oriented settings. However, objects and classes come with open erarchie...
174
click to vote
JAPLL
2006
15 years 5 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
139
click to vote
EICS
2009
ACM
16 years 2 days ago
2009
ACM
This paper discusses the use of formal methods for analysing human-computer interaction. We focus on the mode confusion problem that arises whenever the user thinks that the syste...