Trends in Functional Programming Volume 1

Inbunden, Engelska, 2000

Av Hans-Wolfgang Loidl, Phil Trinder, Greg Michaelson

659 kr

Tillfälligt slut

This book brings together leading researchers and practitioners in the field of functional programming. The work presented here covers many aspects of the field, including:language design proof and transformationsemantics and modelsimplementationapplicationstype systemsparallelism and distributionperformance modelling and profilingprogramming methodologiesThe Editors provide a substantial introduction to a wide ranging set of papers, arranged by subject area. Appropriate overviews and summaries bring strong thematic links between chapters and sections covering:Parallel Systems and ProgrammingType SystemsArchitectures and ImplementationsApplicationsTheoryThe articles themselves are drawn from the First Scottish Functional Programming Workshop, held in Stirling in 1999. Central Scotland has been very influential in the development of functional programming, with notable contributions including the design, implementation and use of the SASL, Standard ML and Haskell languages. The Workshops provide an international forum, linking a vibrant Scottish core with the wider community. As a product of this forum, the book brings a broad perspective on current research trends and practice in the field.

Produktinformation

Utgivningsdatum2000-12-01
Mått178 x 229 x undefined mm
FormatInbunden
SpråkEngelska
SerieTrends in Functional Programming
Antal sidor256
FörlagIntellect
ISBN9781841500249

Tillhör följande kategorier

Programmeringsböcker inom Data och it

Acknowledgements i Preface iii I PARALLEL SYSTEMS AND PROGRAMMING 11 Bypassing of Channels in Eden 2Ulrike Klusike, Ricardo Peña and Clara Segura1.1 Introduction 21.2 Eden and Bypassing 31.3 CoreEden and Annotated CoreEden 41.4 Bypassing Analysis 51.5 The Bypassing Protocol 61.6 Communication Costs and Conclusions 10 2 From GrandSim to Paradise 11Félix Hernández, Ricardo Peña and Fernando Rubio2.1 Introduction 112.2 GrandSim 122.3 Eden 122.4 Paradise 142.5 Current State of the Implementation 192.6 Related Work, Future Work and Conclusion 19 3 BSP-based Cost Analysis of Skeletal Programs 20Yashushi Hayashi and Murray Cole 3.1 Introduction 203.2 Background and Previous Work 213.3 A BSP Cost Algebra 223.4 A VEC-BSP Implementation Strategy 233.5 A Cost Translation Framework 273.6 Example and Discussion 273.7 Summary and Future Work 27 4 High Level BSP Programming: BSML and BSλ 294.1 Introduction 294.2 Explicit Processes + Flat Parallelism = Direct Mode 294.3 BSML 304.4 The BSMLlib Experiment 314.5 Timings for BSMLlib 334.6 Conclusions and Future Work 38 II TYPES 395 Deep Type Inference for Mobile Functions 40Stephen Gilmore5.1 Introduction 405.2 Compiling to Java Byte Code 415.3 Understanding the Static Semantics 465.4 Using Deep Types to Detect Unchecked Updates 475.5 Related Work 48 6 Generalizing Techniques for Type Debugging 49Bruce J. McAdam6.1 Introduction 496.2 Graphs 496.3 Basic Analysis of Graphs 516.4 Bernstein and Stark's Assumption Environments 536.5 Wand's Source of Type Errors 556.6 Duggan's Correct Type Explanations 566.7 Conclusions 57 7 Explaining Type Errors by Finding the Source of a Type Conflict 58Jun Yang7.1 Introduction 587.2 Unification of Assumption Environments (μAE) 607.3 Incremental Error Inference 617.4 Conclusions 647.5 Acknowledgements 66 8 How to Combine the Benefits of Strict and Soft Typing 67Manfred Widera and Christoph Beierle 8.1 Introduction 678.2 The Use of Complete Type Checking 688.3 The Definition of Complete Subtyping 708.4 Conclusion and Future Work 75 III ARCHITECTURES AND IMPLEMENTATION 779 Interfacing Java with Haskell 78Mark Green and Ali E. Abdallah9.1 Introduction 789.2 Possible Approaches 799.3 Java-Haskell Interface Implementation 809.4 Examples of Use 839.5 Conclusion 86 10 An Abstract Machine for Memory Management 8810.1 Introduction 8810.2 Abstract Machines 8910.3 Garbage Collection 9110.4 Further Work 95 11 The MT Architecture and Allocation Algorithm 97 Marco T. Morazán and Douglas R. Troeger11.1 The MT System 9711.2 Expected Advantages of MT 9911.3 Experiment I: List of Fibonacci Numbers Using References to Objects 10011.4 Experiment II: Simple Lists in MT 10211.5 Experiment III: A List of Simple Lists 10311.6 Summarising Remarks 104 12 ZG-machine: a Space-Efficient G-machine 105Gyun Woo and Taisook Han12.1 Introduction 10512.2 Tag-forwarding 10612.3 Experiments 10712.4 Summary and Related Work 112 IV APPLICATIONS 11413 A Functional Design Framework for Genetic Algorithms 115Fethi A. Rabhi, Guy Lapalme and Albert Y. Zomaya13.1 Introduction 11513.2 Genetic Algorithms 11613.3 The Single-row Routing (SRR) Problem 11913.4 Solving the SRR Problem with the GA Framework 12113.5 Conclusion and Future Work 123 14 An Industrial use of FP: A Tool for Generating Test Scripts from Sys-tem Specifications 125Paul Baker, Clive Jervis and David J. King14.1 Introduction 12514.2 Motivation for Using Formal Methods 12614.3 Formal Specification with Message Sequence Charts 12614.4 Generating Test Scripts from MSCs 12714.5 Implementation of ptk 12914.6 How could Functional Languages be Improved to Better Meet the Requirements of Industry 13114.7 Conclusions 132 V THEORY 13315 List Homomorphisms with Accumulation and Indexing 134Walter Dosch and Bernd Wiedemann15.1 Introduction 13415.2 Data Parallel List Programming 13515.3 List Homomorphisms With Accumulation 13715.4 Conclusion and Related Work 141 16 Reuse by Program Transformation 143Ralf Lämmel16.1 Introduction 14316.2 Motivation by Examples 14416.3 Transformation Operators 14716.4 Concluding Remarks 151 17 An Abstract Machine for Parallel Lazy Evaluation 153Clem Baker-Finch17.1 Introduction 15317.2 Sequential Lazy Abstract Machines 15417.3 Fully Speculative Evaluation 15517.4 Parallelism with par and seq 15817.5 Modelling Limited Resources 15917.6 Conclusion 160 Bibliography 162