10271 search results - page 1697 / 2055 » Computer Science |
168
Voted
LICS
2007
IEEE
16 years 1 months ago
2007
IEEE
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...
156
click to vote
LICS
2007
IEEE
16 years 1 months ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
161
click to vote
SCCC
2007
IEEE
16 years 1 months ago
2007
IEEE
There is no doubt about the increase in popularity of decentralised systems over the classical client-server architecture in distributed applications. These systems are developed ...
132
click to vote
WCRE
2007
IEEE
16 years 1 months ago
2007
IEEE
tection via Structural Abstraction William S. Evans Department of Computer Science University of British Columbia Vancouver, B.C. V6T 1Z4, CANADA Christopher W. Fraser Microsoft Re...
156
click to vote
CSR
2007
Springer
16 years 27 days ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...