Sciweavers

3228 search results - page 275 / 646
» Computationally Sound Proofs
Sort
View
ENTCS
2008
101views more  ENTCS 2008»
15 years 4 months ago
Normalization for the Simply-Typed Lambda-Calculus in Twelf
Normalization for the simply-typed -calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait'...
Andreas Abel
109
Voted
FOCM
2006
87views more  FOCM 2006»
15 years 4 months ago
Index Pairs Algorithms
We introduce some modifications and extensions of the concept od index pair in the Conley index theory. We then show how these concepts may be used to overcome some difficulties in...
Marian Mrozek
MFCS
2010
Springer
15 years 3 months ago
Harnessing MLF with the Power of System F
We provide a strong normalization result for MLF , a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calc...
Giulio Manzonetto, Paolo Tranquilli
COMPUTING
2006
102views more  COMPUTING 2006»
15 years 4 months ago
A Reliable Area Reduction Technique for Solving Circle Packing Problems
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
Mihály Csaba Markót, Tibor Csendes
TCS
2010
15 years 3 months ago
A hierarchical strongly aperiodic set of tiles in the hyperbolic plane
We give a new construction of strongly aperiodic set of tiles in H2 , exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that t...
Chaim Goodman-Strauss