2138 search results - page 350 / 428 » Logical Step-Indexed Logical Relations |
139
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
138
click to vote
ICFP
2004
ACM
16 years 4 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
137
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
158
click to vote
ICCAD
2008
IEEE
16 years 1 months ago
2008
IEEE
—We are developing a framework for computation with biochemical reactions with a focus on synthesizing specific logical functionality, a task analogous to technology-independent...
156
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...