Functional programming, Glasgow 1992: proceedings of the 1992 Glasgow Workshop on Functional Programming, Ayr, Scotland, 6-8 July 1992
This volume contains the papers presented at the latest Glasgow Workshop on Functional Programming, held in Ayr, Scotland, 6-8 July 1992. These workshops have been held annually by the Glasgow Functional Programming group since 1988. Despite the obvious advantages of functional programming, there are still several unresolved research issues which prevent it from reaching its full potential. The workshops provide a valuable opportunity for the investigation of these issues, and for the presentation of current research work. They also allow in-depth discussion between members of the group and invited contributors from industry and other institutions. The papers presented at the workshop concentrated on the design and implementation of functional programming languages, including profiling, compiling, and extensions to Haskell. Other papers addressed the related issues of program derivation and formal reasoning. Among the specific topics covered in this volume are: naturally embedded query languages; a framework for program analysis of logics; analysing functions by projection-based backward abstraction; compile-time optimisation of storage utilisation for lazy first order functional programs; a relational derivation of a functional program; programming with conductor classes; avoiding unnecessary updates; LZW compression in Haskell; program transformation in the Glasgow Haskell compiler; formulating Haskell. Functional Programming, Glasgow 1992 provides an up-to-date cross-section of the latest work on functional programming. It will be of interest to postgraduate students, researchers and practitioners involved in both practical and theoretical aspects of the subject.
What people are saying - Write a review
We haven't found any reviews in the usual places.
High Level Specification of IO in Functional Languages
Guys RISC Implementation of the Three Instruction
12 other sections not shown
Other editions - View all
abstract interpretation algebra annotations argument behaviour benchmark Binfile Bool cell circuit closure component Computer Science Concurrent Clean construct constructor continuous backward abstraction continuous function converge cost centre data structures defined definition denotes divergent domain elements empty environment equivalence evaluation Event I/O example expr expression false finite fixpoint functional languages Glasgow Haskell compiler graph Haskell program heap higher-order higher-order functions idempotent implementation input interaction interface IOState label lambda lambda calculus lazy evaluation lazy functional least backward abstraction let rec lift true logic loop module monad monotonic netlist node operations output partial application perform Peyton Jones Philip Wadler problem profiling projection recursive reduction referential transparency relation result right type rules sequential algorithms shared specification step semantics strictness analysis String tion transformations tree unboxed University of Glasgow update variable Wadler Workshop write