See this document in CiteSeerX!

Strictness, totality, and non-standard type  (Make Corrections)  
inference Mario Coppo Ferruccio Damiani Paola Giannini Dipartimento di...



  Home/Search   Context   Related

 
View or download:
di.unito.it/~damiani/papers/tcs1.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  macs.hw.ac.uk/~jbw...bibliography (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper we present two non-standard type inference systems for conjunctive strictness and totality analyses of higher-order typed functional programs and prove completeness results for both the strictness and the totality type entailment relations. We also study the interactions between strictness and totality analyses, showing that the information obtainable by a system that combines the two analyses, even though more refined than the information given by the two separate systems, cannot ... (Update)

Active bibliography (related documents):   More   All
1.0:   Detecting and Removing Dead Code using Rank 2 Intersection - Damiani, Prost (1997)   (Correct)
0.6:   Inference of Polymorphic and Conditional Strictness Properties - Jensen (1998)   (Correct)
0.5:   Strictness and Totality Analysis - Solberg, Nielson, Nielson (1994)   (Correct)

Similar documents based on text:   More   All
0.4:   Re-classification and Multi-threading: Fickle_MT - Damiani, Dezani-Ciancaglini, ..   (Correct)
0.4:   More Dynamic Object Re-classification: Fickle_II - Drossopoulou, Damiani..   (Correct)
0.3:   Rank 2 Intersection Types for Modules - Damiani (2003)   (Correct)

BibTeX entry:   (Update)

@misc{ coppo-strictness,
  author = "Inference Mario Coppo",
  title = "Strictness, Totality, and Non-Standard Type",
  url = "citeseer.ist.psu.edu/669598.html" }
Citations (may not include all citations):
906   A structural approach to operational semantics - Plotkin - 1981
809   A Theory of Type Polymorphism in Programming (context) - Milner - 1978
306   LCF considered as a programming language (context) - Plotkin - 1977
233   Natural semantics (context) - Kahn - 1988
160   The principal type scheme for an object in combinatory logic (context) - Hindley - 1969
137   A filter lambda model and the completeness of type assignmen.. (context) - Barendregt, Coppo et al. - 1983
67   Strictness Analysis for Higher-Order Functions (context) - Burn, Hankin et al. - 1986
54   Functional Characters of Solvable Terms (context) - Coppo, Dezani-Ciancaglini et al. - 1981
48   Operationally-based theories of program equivalence - Pitts - 1997
45   Intersection Type Disciplines in Lambda Calculus and Applica.. (context) - van Bakel - 1993
24   Strictness Analysis of Lazy Functional Programs (context) - Benton - 1992
18   Abstract Interpretation in Logical Form (context) - Jensen - 1992
11   Theoretical Computer Science (context) - Coppo, Ferrari et al. - 1993
8   Principal type schemas for functional programs (context) - Damas, Milner - 1982
8   An extension of basic functional theory for lambda-calculus (context) - Coppo, Dezani-Ciancaglini - 1980
6   Non-standard type inference for functional programs (context) - Damiani - 1998
5   Strictness and Totality Analysis - Solberg, Nielson et al. - 1994
5   Completeness of type assignment in continuous lambda models (context) - Coppo - 1984
4   Annotated Type Systems for Program Analysis - Solberg - 1995
4   Strictness and Totality Analysis with Conjunction - Solberg - 1995
3   Lazy type inference and program analysis (context) - Hankin, Le M'etayer - 1995
3   Conjunctive Type Systems and Abstract Interpretation of High.. (context) - Jensen - 1995
3   On Strictness and Totality (context) - Coppo, Damiani et al. - 1997
2   Deriving algorithms for type inference systems: Applications.. (context) - Hankin, Le M'etayer - 1994
1   Science of Computer Programming (context) - Solberg, Nielson et al. - 1998

Documents on the same site (http://www.macs.hw.ac.uk/~jbw/itrs/bibliography.html):   More
Type Assignement for Mobile Objects - Barbanera, de'Liguoro   (Correct)
Logical Semantics for the First Order ζ-Calculus - van Bakel, de'Liguoro   (Correct)
A Linearization of the Lambda-Calculus and Consequences - Kfoury (2000)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC