Kirsten Lackner Solberg  Home/Search
Context Related
| daimi.au.dk/PB/498/PB498.ps.gz daimi.aau.dk/~kls/thesis.ps.Z purdue.edu/homes/p...lbergthesis95.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: daimi.aau.dk/DAIMI/PBlist (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Interpretation Table 1.2: Annotations in the Thesis In Chapter 2 we present a combined strictness and totality analysis . We are specifying the analysis as an annotated type system. The type system allows conjunctions of annotated types, but only at the top-level. The analysis is somewhat more powerful than the strictness analysis by Kuo and Mishra [KM89] due to the conjunctions and in that we also consider totality. The analysis is shown sound with respect to a natural-style operational... (Update)
Context of citations to this paper: More
...information. This work can be recast in the present framework by including additional layers of annotations. Solberg, in her PhD thesis [33], gives a general overview of the use of annotated type systems in program analysis. She considers BTA in the style of Nielson and...
...Type systems tailored to specific analysis, such as strictness, totality, binding time etc. have been introduced, see [18, 16, 2, 12, 15, 22, 25, 13]. In this perspective types represent program properties and their inference systems are systems for reasoning formally...
Cited by: More
Strictness, Totality, and Non-Standard Type - Inference Mario Coppo (Correct)
Strictness and Totality Analysis - Solberg, Nielson, Nielson (1994) (Correct)
Detecting and Removing Dead Code using Rank 2 Intersection - Damiani, Prost (1997) (Correct)
Similar documents (at the sentence level):
5.1%: Inference Systems for Binding Time Analysis - Solberg (1993) (Correct)
Active bibliography (related documents): More All
0.1: Type Theory and Projections for Static Analysis - Baker-Finch (1995) (Correct)
0.1: Type Theory and Projections for Higher-Order Static Analysis - Baker-Finch (Correct)
0.1: Elimination of Negation in a Logical Framework - Momigliano (2000) (Correct)
Similar documents based on text: More All
0.8: Polymorphic Subtyping for Effect Analysis: the Static.. - Nielson, Nielson, Amtoft (1997) (Correct)
0.7: Polymorphic Subtyping for Effect Analysis: the Algorithm - Nielson, Nielson, Amtoft (1997) (Correct)
0.7: Polymorphic Subtyping for Effect Analysis: the Dynamic.. - Amtoft, Nielson.. (1997) (Correct)
Related documents from co-citation: More All
3: Abstract Interpretation in Logical Form (context) - Jensen - 1992
2: Deriving algorithms for type inference systems: Applications to strictness analy.. (context) - Hankin, Le M'etayer - 1994
2: A structural approach to operational semantics - Plotkin - 1981
BibTeX entry: (Update)
K. L. Solberg. Annotated Type Systems for Program Analysis. PhD thesis, Odense University, Denmark, July 1995. Also technical report DAIMI PB-498, Comp. Sci. Dept. Aarhus University. http://citeseer.ist.psu.edu/solberg95annotated.html More
@misc{ solberg95annotated,
author = "K. Solberg",
title = "Annotated Type Systems for Program Analysis",
text = "K. L. Solberg. Annotated Type Systems for Program Analysis. PhD thesis,
Odense University, Denmark, July 1995. Also technical report DAIMI PB-498,
Comp. Sci. Dept. Aarhus University.",
year = "1995",
url = "citeseer.ist.psu.edu/solberg95annotated.html" }
Citations (may not include all citations):258 Miranda: A non-strict functional language with polymorphic t.. (context) - Turner - 1985
94 Projections for strictness analysis - Wadler, Hughes - 1987
73 Is there a use for linear logic (context) - Wadler - 1991
54 Strictness analysis on non-flat domains (context) - Wadler - 1987
25 A new technique for strictness analysis (context) - Wright - 1991
13 Usage analysis with natural reduction types (context) - Wright, Baker-Finch - 1993
Documents on the same site (http://www.daimi.aau.dk/DAIMI/PB-list.html): More
Cryptanalysis of LOKI 91 - Knudsen (1993) (Correct)
AVL Trees with Relaxed Balance - Larsen (1992) (Correct)
Computer Aided Verification of Lamport's Fast Mutual.. - Jørgensen, Kristensen (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