Sciweavers

SAS
1994
Springer
14 years 3 months ago
A Systematic Construction of Abstract Domains
Dmitri Boulanger, Maurice Bruynooghe
SAS
1994
Springer
14 years 3 months ago
Directional Type Checking of Logic Programs
Alexander Aiken, T. K. Lakshman
SAS
1994
Springer
104views Formal Methods» more  SAS 1994»
14 years 3 months ago
Strictness and Totality Analysis
We definea novelinference systemfor strictness andtotality analysisfor the simplytyped lazy lambda-calculus with constants and fixpoints. Strictness information identifies those t...
Kirsten Lackner Solberg
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
14 years 3 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
SAS
1994
Springer
14 years 3 months ago
Generating Transformers for Deforestation and Supercompilation
Abstract. Our aim is to study how the interpretive approach -- inserting an interpreter between a source program and a program specializer -- can be used to improve the transformat...
Robert Glück, Jesper Jørgensen
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
14 years 3 months ago
Efficient Strictness Analysis of Haskell
Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy fu...
Kristian Damm Jensen, Peter Hjæresen, Mads R...
SAS
1994
Springer
136views Formal Methods» more  SAS 1994»
14 years 3 months ago
Constraint-Based Type Inference and Parametric Polymorphism
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
Ole Agesen
SAS
1994
Springer
14 years 3 months ago
Estimating the Computational Cost of Logic Programs
Saumya K. Debray, Pedro López-García...