111 search results - page 11 / 23 » A Proof of Strong Normalisation using Domain Theory |
CADE
2005
Springer
14 years 8 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
ACS
2005
13 years 8 months ago
2005
We develop a symmetric analog of brace algebras and discuss the relation of such algebras to L-algebras. We give an alternate proof that the category of symmetric brace algebras is...
CP
2007
Springer
14 years 2 months ago
2007
Springer
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
LICS
2002
IEEE
14 years 1 months ago
2002
IEEE
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
CP
2004
Springer
14 years 1 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...