45 search results - page 4 / 9 » The Inez Mathematical Programming Modulo Theories Framework |
123
click to vote
ICALP
2001
Springer
15 years 6 months ago
2001
Springer
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
142
click to vote
CALCO
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...
115
click to vote
SIAMJO
2011
14 years 8 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
144
Voted
LPAR
2012
Springer
13 years 9 months ago
2012
Springer
traction with Interpolants for Arrays Francesco Alberti1 , Roberto Bruttomesso2 , Silvio Ghilardi2 , Silvio Ranise3 , Natasha Sharygina1 1 Universit`a della Svizzera Italiana, Luga...
129
click to vote
ICFP
2005
ACM
16 years 1 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...