Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

CSL
2005
Springer

favoriteEmaildiscussreport

104views Automated Reasoning» more CSL 2005»

Complexity and Intensionality in a Type-1 Framework for Computable Analysis

13 years 10 months ago

Complexity and Intensionality in a Type-1 Framework for Computable Analysis

Download www.brics.dk

Implementations of real number computations have largely been unusable in practice because of their very bad performance, especially in comparison to ﬂoating point arithmetic implemented in hardware. This performance problem is to a very large extent due to the type-2 nature of the computable analysis frameworks usually employed. This problem can be overcome by employing a type-1 approach. This paper presents such an approach and deals with properties of it that

Branimir Lambov

Real-time Traffic

Computable Analysis Frameworks | CSL 2005 | Real Number Computations | Type-1 Approach |

claim paper

Related Content

» Fully reflexive intensional type analysis

» A Dependently Typed Framework for Static Analysis of Program Execution Costs

» Modular Complexity Analysis via Relative Complexity

» Realizing Correspondences in Multiviewpoint Specifications

» An Analysis on Transformational Analogy General Framework and Complexity

» Performance analysis challenges and framework for highperformance reconfigurable computing

» A Data Model for XML Databases

» A performance evaluation framework for IEEE 80211 adhoc networks

» Distributed Algorithm for Computing Formal Concepts Using MapReduce Framework

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	CSL
Authors	Branimir Lambov

Comments (0)