867 search results - page 87 / 174 » On Two Forms of Structural Recursion |
106
Voted
JCC
2008
15 years 2 months ago
2008
: An explicit ion, implicit water solvent model for molecular dynamics was developed and tested with DNA and RNA simulations. The implicit water model uses the finite difference Po...
127
Voted
ICFP
2005
ACM
16 years 2 months ago
2005
ACM
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
171
Voted
WIA
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...
127
Voted
ESOP
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
118
click to vote
AAAI
2008
15 years 4 months ago
2008
Modal logic represents knowledge that agents have about other agents' knowledge. Probabilistic modal logic further captures probabilistic beliefs about probabilistic beliefs....