Sciweavers

891 search results - page 9 / 179
» Full Abstraction for PCF
Sort
View
LFCS
2009
Springer
14 years 2 months ago
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System
Abstract. We address the problem of quantitative comparison of classical and intuitionistic logics within the language of the full propositional system. We apply two different app...
Antoine Genitrini, Jakub Kozik
MOC
2000
84views more  MOC 2000»
13 years 7 months ago
Solving Thue equations without the full unit group
Abstract. The main problem when solving a Thue equation is the computation of the unit group of a certain number field. In this paper we show that the knowledge of a subgroup of fi...
Guillaume Hanrot
XSYM
2009
Springer
138views Database» more  XSYM 2009»
14 years 2 months ago
XQuery Full Text Implementation in BaseX
Abstract. LONG PAPER. BaseX is an early adopter of the upcoming XQuery Full Text Recommendation. This paper presents some of the enhancements made to the XML database to fully supp...
Christian Grün, Sebastian Gath, Alexander Hol...
CANS
2011
Springer
254views Cryptology» more  CANS 2011»
12 years 7 months ago
Algebraic Cryptanalysis of the Round-Reduced and Side Channel Analysis of the Full PRINTCipher-48
Abstract. In this paper we analyze the recently proposed light-weight block cipher PRINTCipher. Applying algebraic methods and SAT-solving we are able to break 8 rounds of PRINTCip...
Stanislav Bulygin, Johannes Buchmann
LICS
1994
IEEE
13 years 11 months ago
Linear Logic, Totality and Full Completeness
I give a `totality space' model for linear logic [4], detaking an abstract view of computations on a datatype. The model has similarities with both the coherence space model ...
Ralph Loader