Sciweavers

374 search results - page 1 / 75
» Complexity and Intensionality in a Type-1 Framework for Comp...
Sort
View
CSL
2005
Springer
13 years 11 months ago
Complexity and Intensionality in a Type-1 Framework for Computable Analysis
Implementations of real number computations have largely been unusable in practice because of their very bad performance, especially in comparison to floating point arithmetic imp...
Branimir Lambov
ICFP
2000
ACM
13 years 9 months ago
Fully reflexive intensional type analysis
Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and ...
Valery Trifonov, Bratin Saha, Zhong Shao
IFL
2005
Springer
207views Formal Methods» more  IFL 2005»
13 years 11 months ago
A Dependently Typed Framework for Static Analysis of Program Execution Costs
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
Edwin Brady, Kevin Hammond
RTA
2010
Springer
13 years 9 months ago
Modular Complexity Analysis via Relative Complexity
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
Harald Zankl, Martin Korp
EDOC
2009
IEEE
13 years 9 months ago
Realizing Correspondences in Multi-viewpoint Specifications
Viewpoint modeling is an effective technique for specifying complex software systems in terms of a set of independent viewpoints and correspondences between them. Each viewpoint f...
José Raúl Romero, Juan Ignacio Jaen,...