659 search results - page 37 / 132 » Binding as sets of scopes |
SIGSOFT
2000
ACM
15 years 4 months ago
2000
ACM
An automatic analysis method for first-order logic with sets and relations is described. A first-order formula is translated to a quantifier-free boolean formula, which has a mode...
122
Voted
ICFP
2003
ACM
16 years 13 days ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
100
Voted
JCP
2006
15 years 13 days ago
2006
In this paper, we discuss a general methodology for analysis and modeling of trust relationships in distributed computing. We discuss the classification of trust relationships, cat...
98
Voted
JOLLI
2002
15 years 4 days ago
2002
Dynamic Predicate Logic (DPL) is a variant of Predicate Logic introduced by Groenendijk en Stokhof. One rationale behind the indroduction of DPL is that it is closer to Natural La...
119
Voted
BMCBI
2008
15 years 18 days ago
2008
Background: Computational methods for characterizing novel transcription factor binding sites search for sequence patterns or "motifs" that appear repeatedly in genomic ...