E-Books durchsuchen
Functional Programming, Glasgow 1991 [1992]
- 11
-
Extending Deforestation for First Order Functional Programs
- 25
-
Combining Single-Space and Two-Space Compacting Garbage Collectors
- 1
-
A Parallel Functional Database on GRIP
- 25
-
A New Sharing Mechanism for the TIM
- 36
-
BWM
- 51
-
<Emphasis Type="SmallCaps">Actress</Emphasis>: an Action Semantics Directed Compiler Generator
- 56
-
The Abstract Interpretation of Higher-Order Functional Languages: From Properties to Abstract Domains
- 73
-
A Note on the Choice of Domains for Projection-Based Program Analysis
- 82
-
An Operational Model of Strictness Properties and its Abstractions
- 100
-
A Novel Approach Towards Peephole Optimisations
- 112
-
Evaluation Order Analysis for Lazy Data Structures
- 128
-
Strictness Analysis Using Hindley-Milner Type Inference
- 146
-
Efficient Type Inference Using Monads (Summary)
- 158
-
Generating More Practical Compilers by Partial Evaluation
- 164
-
A Loop-Detecting Interpreter for Lazy Programs
- 177
-
Making functionality more general
- 191
-
Getting your wires crossed
- 207
-
Implementing Projection-based Strictness Analysis
- 225
-
Vuillemin’s Exact Real Arithmetic
- 239
-
A Semantics for Relational Programming
- 253
-
From Primitive Recursive Functions to Silicon through Relations
- 265
-
Functional Compilation from the Standard ML Core Language to Lambda Calculus
- 278
-
TIP in Haskell — another exercise in functional programming
- 293
-
Experiments in Haskell - A Network Simulation Algorithm
- 298
-
Operational Theories of Improvement in Functional Languages
- 324
-
External Function Calls in a Functional Language
- 332
-
A note on abstraction in Ruby
- 339
-
Requirements for a Functional Programming Environment
- 347
-
Debugging by Dataflow — Summary
- 352
-
Using XView/X11 from Miranda