Sciweavers

541 search results - page 9 / 109
» Applications of nonstandard analysis in additive number theo...
Sort
View
JUCS
2010
95views more  JUCS 2010»
13 years 3 months ago
Realisability for Induction and Coinduction with Applications to Constructive Analysis
Abstract: We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped -calcul...
Ulrich Berger
POPL
1990
ACM
14 years 20 days ago
Higher-Order Modules and the Phase Distinction
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
Robert Harper, John C. Mitchell, Eugenio Moggi
INFOCOM
2006
IEEE
14 years 2 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 1 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
ICFP
2007
ACM
14 years 8 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson