1948 search results - page 88 / 390 » Formalizing Mirror Theory |
161
click to vote
MST
2007
15 years 4 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
168
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
The probabilistic formalism of quantum physics is said to provide a sound basis for building a principled information retrieval framework. Such a framework can be based on the not...
133
click to vote
CIE
2005
Springer
15 years 11 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
133
click to vote
IEAAIE
2000
Springer
15 years 9 months ago
2000
Springer
It has already been noted that the accurate prediction of societal responses requires the use of a formal model based on some social or cultural taxonomy. One such taxonomic candi...
141
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI. CBI differs from exi...