Sciweavers

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

12

SAS
1994
Springer

favoriteEmaildiscussreport

104views Formal Methods» more SAS 1994»

Strictness and Totality Analysis

13 years 8 months ago

Strictness and Totality Analysis

Download www.cs.ucla.edu

We definea novelinference systemfor strictness andtotality analysisfor the simplytyped lazy lambda-calculus with constants and fixpoints. Strictness information identifies those terms that definitely denote bottom (i.e. do not evaluate to WHNF) whereas totality information identifies those terms that definitely do not denote bottom (i.e. do evaluate to WHNF). The analysis is presented as an annotated type system allowing conjunctions only at "top-level". We give examples of its use and prove the correctness with respect to a natural-style operational semantics.

Kirsten Lackner Solberg

Real-time Traffic

Evaluate | Formal Methods | Natural-style Operational Semantics | SAS 1994 | Simplytyped Lazy Lambda-calculus |

claim paper

Related Content

» A fuzzy analysis of a Richter theorem in fuzzy consumers

» The Total Overflow during a Busy Cycle in a MarkovAdditive Finite Buffer System

» Strictness totality and nonstandardtype inference

» HighSNR Analysis of OutageLimited Communications with Bursty and DelayLimited Information

» Analysis of Rotational Robustness of Hand Detection with a ViolaJones Detector

» Strictness Analysis for Attribute Grammars

» Iterative Fixed Point Computation for TypeBased Strictness Analysis

» Efficient Strictness Analysis of Haskell

» Finiteness Conditions for Strictness Analysis

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1994
Where	SAS
Authors	Kirsten Lackner Solberg

Comments (0)