- researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 66 from 66

1995

Proceedings of the 1994 Glasgow Workshop on Functional Programming, Ayr, Scotland, UK, September 12-14, 1994Kevin Hammond, David N. Turner, Patrick M. Sansom, editors, Workshops in Computing, Springer, 1995. [doi]

1994

A Case Study in Parallel Program Derivation: the Heat Equation AlgorithmJohn O'Donnell 0001, Gudula Rünger. 1995: 167-183 [doi]

Expression Refinement: Deriving Bresenham's AlgorithmAlexander Bunkenburg, Sharon Flynn. 1995: 1-17 [doi]

Dynamic Algebra for Calculating AlgorithmsKieran Clenaghan. 1995: 18-28 [doi]

On the expressive power of Constructor ClassesLuc Duponcheel, Erik Meijer 0001. 1995: 29-49 [doi]

Programming Reactive Systems in HaskellSigbjørn Finne, Simon Peyton Jones. 1995: 50-65 [doi]

Techniques for Simplifying the Visualization of Graph ReductionSandra P. Foubister, Colin Runciman. 1995: 66-77 [doi]

A Tutorial on Co-induction and Functional ProgrammingAndrew D. Gordon. 1995: 78-95 [doi]

Unboxing using SpecialisationCordelia V. Hall, Simon L. Peyton Jones, Patrick M. Sansom. 1995: 96-110 [doi]

Improving Granularity in Parallel Functional Programs: A Graphical Winnowing System for HaskellKevin Hammond, Hans-Wolfgang Loidl, Andrew S. Partridge. 1995: 111-126 [doi]

Fold-Unfold Transformations on State Monadic InterpretersThomas Johnsson. 1995: 127-140 [doi]

Compilation by Transformation in the Glasgow Haskell CompilerSimon Peyton Jones, André L. M. Santos. 1995: 184-204 [doi]

Functional Binomial QueuesDavid J. King. 1995: 141-150 [doi]

Mechanized Reasoning about Functional ProgramsSava Mintchev. 1995: 151-166 [doi]

Proceedings of the 1993 Glasgow Workshop on Functional Programming, Ayr, Scotland, UK, July 5-7, 1993John T. O'Donnell, Kevin Hammond, editors, Workshops in Computing, Springer, 1994. [doi]

Experience of developing a cervical cytology scanning system using Gofer and HaskellIan Poole, Derek Charleston. 1995: 205-217 [doi]

Binding-time Improvement and Fold/Unfold TransformationColin Runciman. 1995: 218-230 [doi]

Data Dependent Concurrency ControlPhil Trinder. 1995: 231-244 [doi]

Type-Checked Message-Passing between Functional ProcessesMalcolm Wallace, Colin Runciman. 1995: 245-254 [doi]

1993

The Boom HierarchyAlexander Bunkenburg. 1994: 1-8 [doi]

Factoring an Adequacy Proof (Preliminary Report)Roy L. Crole, Andrew D. Gordon. 1994: 9-25 [doi]

Projection-based Termination AnalysisKei Davis. 1994: 26-42 [doi]

A framework for optimising abstract data typesCordelia V. Hall. 1994: 43-57 [doi]

Spiking Your CachesKevin Hammond, Geoffrey L. Burn, Denis B. Howe. 1994: 58-68 [doi]

Experiments with destructive updates in a lazy functional language (extended abstract)Pieter H. Hartel, Willem G. Vree. 1994: 69-82 [doi]

The aim is laziness in a data-parallel languageJonathan M. D. Hill. 1994: 83-99 [doi]

On the Comparative Evaluation of Parallel Languages and Systems: A Functional NoteRobert E. Hiromoto. 1994: 100-112 [doi]

Deterministic ConcurrencyIan Holyer, David Carter. 1994: 113-126 [doi]

Using Strictness in the STG MachineDenis B. Howe, Geoffrey L. Burn. 1994: 127-137 [doi]

The Implementer's Dilemma: A Mathematical Model of Compile Time Garbage CollectionSimon B. Jones, Andrew S. Tyas. 1994: 138-144 [doi]

Measuring the effectiveness of a simple strictness analyserSimon Peyton Jones, Will Partain. 1994: 201-221 [doi]

Local Speculative Evaluation for Distributed Graph ReductionJames S. Mattson Jr., William G. Griswold. 1994: 185-192 [doi]

Functional Graph Algorithms with Depth-First Search (Preliminary Summary)David J. King, John Launchbury. 1994: 145-155 [doi]

Distributed Garbage Collection of Cyclic StructuresDavid R. Lester. 1994: 156-169 [doi]

Update Avoidance Analysis by Abstract InterpretationSimon Marlow. 1994: 170-184 [doi]

Bidirectional Fold and ScanJohn T. O'Donnell. 1994: 193-200 [doi]

Implementing Fudgets with Standard Widget SetsAlastair Reid, Satnam Singh. 1994: 222-235 [doi]

Profiling Parallel Functional Computations (Without Parallel Machines)Colin Runciman, David Wakeling. 1994: 236-251 [doi]

Time Profiling a Lazy Functional CompilerPatrick M. Sansom. 1994: 252-264 [doi]

Solving recursive domain equations by term rewritingJulian Seward. 1994: 265-279 [doi]

Separating InteractionDuncan C. Sinclair. 1994: 280-286 [doi]

1991

Proceedings of the 1990 Glasgow Workshop on Functional Programming, Ullapool, Scotland, UK, August 13-15, 1990Simon L. Peyton Jones, Graham Hutton, Carsten Kehler Holst, editors, Workshops in Computing, Springer, 1991. [doi]

1990

Lifetime analysisGuy Argo. 1991: 1-8 [doi]

Compiling Laziness by Partial EvaluationAnders Bondorf. 1991: 9-22 [doi]

Strictness Analysis in 4DKei Davis, Philip Wadler. 1991: 23-43 [doi]

An Algorithmic and Semantic Approach to DebuggingCordelia V. Hall, Kevin Hammond, John T. O'Donnell. 1991: 44-53 [doi]

Compile-Time Garbage Collection by Necessity AnalysisGeoff W. Hamilton, Simon B. Jones. 1991: 66-70 [doi]

Abstract Interpretation of Term Graph Rewriting SystemsChris Hankin. 1991: 54-65 [doi]

Improving Full LazinessCarsten Kehler Holst. 1991: 71-82 [doi]

Towards Binding-Time Improvement for FreeCarsten Kehler Holst, John Hughes. 1991: 83-100 [doi]

Towards Relating Forwards and Backwards AnalysesJohn Hughes, John Launchbury. 1991: 101-113 [doi]

PERs Generalise Projections for Strictness Analysis (Extended Abstract)Sebastian Hunt. 1991: 114-125 [doi]

Functional Programming with RelationsGraham Hutton. 1991: 126-140 [doi]

Abstract Interpretation vs. Type Inference A Topological PerspectiveThomas P. Jensen. 1991: 141-145 [doi]

Analysing Heap Contents in a Graph Reduction Intermediate LanguageThomas Johnsson. 1991: 146-171 [doi]

Is Compile Time Garbage Collection Worth the Effort?Simon B. Jones, Michael White. 1991: 172-176 [doi]

Generating a Pattern Matching Compiler by Partial EvaluationJesper Jørgensen. 1991: 177-195 [doi]

An Experiment using Term Rewriting Techniques for ConcurrencyCarron Kirkwood. 1991: 196-200 [doi]

Type Refinement in RubyDavid Murphy. 1991: 201-217 [doi]

Normal-Order Reduction Using Scan PrimitivesWilliam D. Partain. 1991: 218-226 [doi]

Calculating lenient programs' performancePaul Roe. 1991: 227-236 [doi]

Problems & Proposals for Time & Space Profiling of Functional ProgramsColin Runciman, David Wakeling. 1991: 237-245 [doi]

Solid Modelling in HaskellDuncan C. Sinclair. 1991: 246-263 [doi]

Differentiating StrictnessSatnam Singh. 1991: 264-267 [doi]

Generalising Diverging Sequences of Rewrite Rules by Synthesising New SortsMuffy Thomas, Phil Watson. 1991: 268-273 [doi]

Concurrent Data Manipulation in a Pure Functional LanguagePhil Trinder. 1991: 274-286 [doi]

Sign in or sign up to see more results.

runs on WebDSL