2529 search results - page 90 / 506 » The Logical Structure of Binding |
ACTA
2007
14 years 10 months ago
2007
The study of hairpin-free words has been initiated in the context of DNA computing. DNA strands that, theoretically speaking, are finite strings over the alphabet {A, G, C, T} are...
BMCBI
2006
14 years 10 months ago
2006
Background: The increasing number of known protein structures provides valuable information about pharmaceutical targets. Drug binding sites are identifiable and suitable lead com...
ENTCS
2006
14 years 10 months ago
2006
The maintenance of organisation is a prerequisite for all viable systems in dynamic environments. In many living systems this organisation is, in part, achieved through coordinati...
ICFP
2005
ACM
15 years 10 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...
103
click to vote
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...