Sciweavers

8766 search results - page 602 / 1754
» Functional logic programming
Sort
View
110
Voted
MST
2008
101views more  MST 2008»
15 years 5 months ago
Realizability interpretation of proofs in constructive analysis
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
Helmut Schwichtenberg
ERSHOV
2009
Springer
15 years 9 months ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...
CTCS
1989
Springer
15 years 9 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
HPCA
2008
IEEE
16 years 5 months ago
Supporting highly-decoupled thread-level redundancy for parallel programs
The continued scaling of device dimensions and the operating voltage reduces the critical charge and thus natural noise tolerance level of transistors. As a result, circuits can p...
M. Wasiur Rashid, Michael C. Huang
WWW
2004
ACM
16 years 5 months ago
Edgecomputing: extending enterprise applications to the edge of the internet
Content delivery networks have evolved beyond traditional distributed caching. With services such as Akamai's EdgeComputing it is now possible to deploy and run enterprise bu...
Andy Davis, Jay Parikh, William E. Weihl