Trends in Functional Programming Volume 3

Inbunden, Engelska, 2013

Del i serien Trends in Functional Programming

510 kr

Tillfälligt slut

Beskrivning

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 modelsimplementationtype systemsparallelism and distributionperformance modelling and profilingprogramming methodologiesThe Editors introduce a wide-ranging set of articles, arranged by general subject area. Short overviews bring strong thematic links between individual articles, including:applicationsimplementation techniquesparallel systems and programmingmemory architecturestype systemsThe articles themselves are drawn from the series of Scottish Functional Programming Workshops. Central Scotland has been highly influential in the development of functional programming with notable contributions that include 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

Utgivningsdatum:2013-01-05
Mått:230 x 170 x undefined mm
Format:Inbunden
Språk:Engelska
Serie:Trends in Functional Programming
Antal sidor:200
Förlag:Intellect
ISBN:9781841500706

Utforska kategorier

Programmeringsböcker inom Data och IT

Innehållsförteckning

1 Haskell: Language for Business Systems 1Dan Russell, Dominic Steinitz and Chris Reade1.1 Introduction 11.2 Background and Related Work 21.3 LDAP 31.4 The LDAP Client 51.5 Using the LDAP API 91.6 Conclusions and Further Work 11 2 Infinite Pretty-printing in eXene 13Allen Stoughton2.1 Pretty-printing with Elision 132.2 Infinite Pretty-printing in eXene 152.3 Flexible Text Values 152.4 Pretty-printing Trees 16 2.5 The eXene Flexible Text Widget 202.6 Pretty-Printing Examples 212.7 Conclusion 3 Extending Higher-Order Deforestation: Transforming Programs toEliminate Even More Trees 25Geoffrey Hamilton3.1 Introduction 253.2 Language 273.3 Extended Higher-Order Treeless Form 283.4 The Extended Higher-Order Deforestation Algorithm 323.5 The Extended Higher-Order Deforestation Theorem 343.6 Conclusion 35 4 BSP in a Lazy Functional Context 37Quentin Miller4.1 Introduction 374.2 BSP Computation 384.3 A Vector Calculus 394.4 The Structure of BSP-Haskell 404.5 Broadcast Functions 414.6 Implementations 424.7 Cost Predictions and Measurements 464.8 Summary and Further Research 47 5 Deriving Non-Hierarchical Process Topologies 51Ricardo Peña, Fernando Rubio, Clara Segura5.1 Introduction 51 5.2 Eden 525.3 Methodology to Derive Non-Hierarchical Topologies 545.4 Examples of Non-Hierarchical Topologies 565.5 Conclusion 61 6 Load Balancing in a Parallel Graph Reducer 63Hans-Wolfgang Loidl6.1 Introduction 636.2 GUM: A Parallel Graph Reducer 646.3 Accessing the Load Distributer in GUM 666.4 Related Work 726.5 Conclusions 73 7 Paging in a Distributed Virtual Memory 75Marco T. Morazán, Douglas R. Troeger, Myles Nash7.1 Introduction 757.2 Related Work 767.3 The MT System 787.4 Virtual Memory Performance of the MT Heap 817.5 Explaining the Competitiveness of FIFO 837.6 Concluding Remarks 84 8 How to Repair Type Errors Automatically 87Bruce McAdam8.1 Introduction- Error Messages 878.2 The Theory Behind this System 898.3 Implementing the Theory 908.4 Performance and Testing 958.5 Conclusions 97 9 The Dual of Substitution is Redecoration 99Tarmo Uustalu, Varmo Vene9.1 Introduction 999.2 Monads 1019.3 Comonads 1019.4 Monads of Trees and Cotrees 1029.5 Comonads of (Co)trees 1059.6 Conclusion and Future Work 109 10 Function Types in Complete Type Inference 111Manfred Widera, Christoph Beierle10.1 Introduction to Complete Type Checking 11110.2 The Type Language 11510.3 The Inappropriateness of Function Types 11510.4 The New Function Type Constructor 11610.5 Conclusion 121