Table of Contents

A New Method for Strictness Analysis on Non-Flat Domains.- Backwards Strictness Analysis: Proved and Improved.- Abstract Interpretation of Polymorphic Functions.- An Iterative Powerdomain Construction.- Complexity Analysis for a Lazy Higher-Order Language.- Deriving the Fast Fourier Algorithm by Calculation.- Chemical Reaction as a Computational Model.- Sketching a Constructive Definition of ‘mix’.- Transformation in a Non-Strict Language: An Approach to Instantiation.- Referentially Transparent Database Languages.- Imperative Effects from a Pure Functional Language.- Designing Data Structures.- Describing Butterfly Networks in Ruby.- Implementation of a Non-Standard Interpretation System.- Simulating Multiprocessor Architectures for Compiled Graph-Reduction.- Dependent Sums Express Separation of Binding Times.- Type Inference and Type Classes.- Implementing Haskell Type Classes.- Implementing Functional Languages on the Transputer.- Hope+ on Flagship.- Expressing and Reasoning About Non-Deterministic Functional Programs.- Evaluation Annotations for Hope+.- Some Ideas On Parallel Functional Programming.- Parsing Using Combinators.- Gerald: An Exceptional Lazy Functional Programming Language.- Geometrization for Interactive Software Development.- Author Index.

Promotional Information

Springer Book Archives