Sciweavers

1712 search results - page 5 / 343
» A Computational Approach to Binding Theory
Sort
View
ICFP
2003
ACM
15 years 11 months ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...
WOLLIC
2007
Springer
15 years 5 months ago
A Formal Calculus for Informal Equality with Binding
Abstract. In informal mathematical usage we often reason using languages with binding. We usually find ourselves placing capture-avoidance constraints on where variables can and c...
Murdoch Gabbay, Aad Mathijssen
BMCBI
2007
126views more  BMCBI 2007»
14 years 11 months ago
High-throughput identification of interacting protein-protein binding sites
Background: With the advent of increasing sequence and structural data, a number of methods have been proposed to locate putative protein binding sites from protein surfaces. Ther...
Jo-Lan Chung, Wei Wang, Philip E. Bourne
JECR
2002
125views more  JECR 2002»
14 years 11 months ago
Why Users Choose Particular Web Sites Over Others: Introducing a "Means-End" Approach to Human-Computer Interaction
means-end theory, widely used in market research, identifies three levels of abstraction
Deepak Prem Subramony
AIMS
2007
Springer
15 years 5 months ago
Modeling Change Without Breaking Promises
Promise theory defines a method by which static service bindings are made in a network, but little work has been done on handling the dynamic case in which bindings must change ov...
Alva L. Couch, Hengky Susanto, Marc Chiarini