2880 search results - page 100 / 576 » Types are calling conventions |
167
click to vote
AISC
2008
Springer
15 years 8 months ago
2008
Springer
We use higher-order logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials o...
120
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
: Business models involving buyers of digital goods in the distribution process are called superdistribution schemes. We review the state-of-the art of research and application of ...
109
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including impl...
135
click to vote
ICML
2003
IEEE
16 years 6 months ago
2003
IEEE
We present a new type of multi-class learning algorithm called a linear-max algorithm. Linearmax algorithms learn with a special type of attribute called a sub-expert. A sub-exper...
125
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...