Functional Programming, Glasgow 1992: Proceedings of the 1992 Glasgow Workshop on Functional Programming, Ayr, Scotland, 6-8 July 1992
John Launchbury, Patrick M. Sansom
Abstract
John Launchbury, Patrick M. Sansom
Abstract
High Level Specification of I/O in Functional Languages.- GRIT: Guy's RISC Implementation of the Three Instruction Machine.- A Logical Framework for Program Analysis.- Analysing Functions by Projection-Based Backward Abstraction.- Abstract Interpretation of Higher Order Functions Using Concrete Data Structures (Summary).- The Glasgow Haskell Compiler: A Retrospective.- Improving Persistent Data Manipulation for Functional Languages.- A Loop-Detecting Interpreter for Lazy, Higher-Order Programs.- A Semantics for Locally Bottom-Avoiding Choice.- A Certain Loss of Identity.- Programming with Constructor Classes (Preliminary Summary).- Combining Monads.- Avoiding Unnecessary Updates.- Deforestation for Higher-Order Functions.- Hazard Algebra and the Design of Asynchronous Automata.- Generating Netlists from Executable Circuit Specifications in a Pure Functional Language.- The nofib Benchmark Suite of Haskell Programs.- Heap Profiling of a Lazy Functional Compiler.- LZW Text Compression in Haskell.- Profiling Lazy Functional Programs.- On Program Transformation in the Glasgow Haskell Compiler.- Graphical User Interfaces for Haskell.- Formulating Haskell.- Author Index.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
High Level Specification of I/O in Functional Languages.- GRIT: Guy's RISC Implementation of the Three Instruction Machine.- A Logical Framework for Program Analysis.- Analysing Functions by Projection-Based Backward Abstraction.- Abstract Interpretation of Higher Order Functions Using Concrete Data Structures (Summary).- The Glasgow Haskell Compiler: A Retrospective.- Improving Persistent Data Manipulation for Functional Languages.- A Loop-Detecting Interpreter for Lazy, Higher-Order Programs.- A Semantics for Locally Bottom-Avoiding Choice.- A Certain Loss of Identity.- Programming with Constructor Classes (Preliminary Summary).- Combining Monads.- Avoiding Unnecessary Updates.- Deforestation for Higher-Order Functions.- Hazard Algebra and the Design of Asynchronous Automata.- Generating Netlists from Executable Circuit Specifications in a Pure Functional Language.- The nofib Benchmark Suite of Haskell Programs.- Heap Profiling of a Lazy Functional Compiler.- LZW Text Compression in Haskell.- Profiling Lazy Functional Programs.- On Program Transformation in the Glasgow Haskell Compiler.- Graphical User Interfaces for Haskell.- Formulating Haskell.- Author Index.
Key concepts: Haskell, Computer science, Functional programming, Programming language, Compiler