Sciweavers

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...
SAS
1993
Springer
139views Formal Methods» more  SAS 1993»
14 years 3 months ago
Compiling FX on the CM-2
Type and effect systems provide a safe and effective means of programming high-performance parallel computers with a high-level language that integrates both functional and impe...
Jean-Pierre Talpin, Pierre Jouvelot
SAS
1993
Springer
126views Formal Methods» more  SAS 1993»
14 years 3 months ago
Finiteness Conditions for Strictness Analysis
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work b...
Flemming Nielson, Hanne Riis Nielson
SAS
1993
Springer
109views Formal Methods» more  SAS 1993»
14 years 3 months ago
Abstract Rewriting
Didier Bert, Rachid Echahed, Bjarte M. Østv...
SAS
1993
Springer
104views Formal Methods» more  SAS 1993»
14 years 3 months ago
Strictness Properties of Lazy Algebraic Datatypes
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
P. N. Benton