Sciweavers

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

29

Voted

SAS
1993
Springer

favoriteEmaildiscussreport

126views Formal Methods» more SAS 1993»

Finiteness Conditions for Strictness Analysis

14 years 3 months ago

Finiteness Conditions for Strictness Analysis

Download www.daimi.au.dk

We give upper bounds on the number of times the ﬁxed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work both in the syntax-directed nature of the approach and in the ability to deal with Wadler’s method for analysing lists. Limitations of the method are indicated.

Flemming Nielson, Hanne Riis Nielson

Real-time Traffic

Formal Methods | SAS 1993 | Upper Bounds | Wadler’s Method | ﬁxed Point Operator |

claim paper

Related Content

» Strictly positive measures on Boolean algebras

» Schedulability Analysis for NonPreemptive Tasks under Strict Periodicity Constraints

» The Parametrized Probabilistic FiniteState Transducer Probe Game Player Fingerprint Model

» Reachability analysis for a class of Petri nets

» How Much NonStrictness do Lenient Programs Require

» Model order reduction for strictly passive and causal distributed systems

» Convergence Analysis for Incompressible Generalized Newtonian Fluid Flows with Nonstandard...

» Bounds for eigenvalues and condition numbers in the pversion of the finite element method

» Convergence of Least Squares Temporal Difference Methods Under General Conditions

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1993
Where	SAS
Authors	Flemming Nielson, Hanne Riis Nielson

Comments (0)