4401 search results - page 549 / 881 » Computing with Default Logic |
168
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
134
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
190
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
157
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Convergence of communication, consumer applications and computing within mobile systems pushes memory requirements both in terms of size, bandwidth and power consumption...
170
click to vote
ICNP
2009
IEEE
16 years 1 months ago
2009
IEEE
—Routing protocols are implemented in the form of software running on a general-purpose microprocessor. However, conventional software-based router architectures face significan...