Sciweavers

63 search results - page 10 / 13
» Short proofs of strong normalization
Sort
View
ICIC
2007
Springer
14 years 4 months ago
Analysis of Pi Series and Its Application to Image Encryption
Whether constant π (i.e., pi) is normal is a confusing problem without any strict theoretical demonstration except for some statistical proof. A new concept of pi series is introd...
Ting Chen, Feng Li
LPAR
2010
Springer
13 years 8 months ago
Logic and Computation in a Lambda Calculus with Intersection and Union Types
We present an explicitly typed lambda calculus "`a la Church" based on the union and intersection types discipline; this system is the counterpart of the standard type a...
Daniel J. Dougherty, Luigi Liquori
CMA
2010
68views more  CMA 2010»
13 years 8 months ago
Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems
It is shown that the Clar number can be arbitrarily larger than the cardinality of a maximal alternating set. In particular, a maximal alternating set of a hexagonal system need n...
Sandi Klavzar, Khaled Salem, Andrej Taranenko
ICALP
2007
Springer
14 years 5 months ago
Reconciling Data Compression and Kolmogorov Complexity
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
Laurent Bienvenu, Wolfgang Merkle
CIE
2008
Springer
14 years 23 days ago
Principal Typings for Explicit Substitutions Calculi
Having principal typings (for short PT) is an important property of type systems. This property guarantees the possibility of type deduction which means it is possible to develop a...
Daniel Lima Ventura, Mauricio Ayala-Rincón,...