1712 search results - page 74 / 343 » A Computational Approach to Binding Theory |
122
click to vote
IJCAI
2001
15 years 2 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
127
click to vote
TACAS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
SAC
2010
ACM
15 years 3 months ago
2010
ACM
Service-oriented architecture (SOA) is a relatively new approach to software system development. It divides system functionality to independent, loosely coupled, interoperable ser...
127
click to vote
ICFP
2003
ACM
16 years 1 months 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...
106
click to vote
AMC
2007
15 years 1 months ago
2007
The new economic geography literature provides a general equilibrium framework that explains the emergence of economic agglomerations as a trade-off between increasing returns at...