Sciweavers

234
Voted
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 11 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
136views Formal Methods» more  SAS 1994»
15 years 11 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
104views Formal Methods» more  SAS 1994»
15 years 11 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
15 years 11 months ago
Estimating the Computational Cost of Logic Programs
Saumya K. Debray, Pedro López-García...
163
Voted
SAS
1994
Springer
15 years 11 months ago
Directional Type Checking of Logic Programs
Alexander Aiken, T. K. Lakshman
Formal Methods
Top of PageReset Settings