Trends in Functional Programming

Name: Trends in Functional Programming | 12th International Symposium, TFP 2011, Madrid, Spain, May 16-18, 2011, Revised Selected Papers
Brand: Springer
Price: 48.14 EUR
Availability: OnlineOnly

12th International Symposium, TFP 2011, Madrid, Spain, May 16-18, 2011, Revised Selected Papers

Ricardo Peña Rex Page(Herausgeber*in)

Springer (Verlag)

Erschienen am 20. Juli 2012

X, 195 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-642-32037-8 (ISBN)

48,14 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Title
Preface
Conference Organization
Table of Contents
Types
Constraint-Free Type Error Slicing
Introduction
From Constraint-Based to Source-Based Type Error Slicing
Source-Based Type Error Slicing
Multiple Type Error Slices
Source-Based Type Error Slicing for Mini-ML
Type Error Slicing for Haskell
Related Work
Future Work
References
Subtyping by Folding an Inductive Relation into a Coinductive One
Introduction
The Fold Pattern
Recursive Types
Definition of Recursive Subtyping
Soundness and Completeness
Monadic Substitution
Related Work
Conclusions
References
Compiling
Epic-A Library for Generating Compilers
Introduction
The Epic Language
Definitions
Foreign Functions
Low Level Features
Haskell API
Example-Compiling the -Calculus
Representation
Compilation
Atuin-A Dynamically Typed Graphics Language
Abstract Syntax
Compiling
Related Work
Conclusion
References
Towards Modular Compilers for Effects
Introduction
Setting the Scene
A Simple Compiler
Adding a New Effect
The Problem
Modular Effects
Modular Syntax and Semantics
Datatypes à La Carte
Smart Constructors
Putting It All Together
Modular Compilers
Towards Modular Machines
Summary and Conclusion
References
Parallelism and Distribution
Functory: A Distributed Computing Library for Objective Caml
Introduction
API
A Generic Distribution Function
Low-Level Primitives
High-Level API
Deployment Scenarios
Several Libraries in One
Implementation Details
Marshaling
Protocol
Fault-Tolerance
Experiments
N-Queens
Matrix Multiplication
Mandelbrot Set
SMT Solvers
Conclusions and Future Work
References
ParaForming: Forming Parallel Haskell Programs Using Novel Refactoring Techniques
Introduction
Contributions
The HaRe Refactoring System for Haskell
GpH and Evaluation Strategies
Refactorings for Forming Parallel Programs
Rewrite Rules
Data Parallelism
Task Parallelism
Refactoring Case Studies
Data Parallelism
Task Parallelism
Performance Results
Related Work
Conclusions and Future Work
References
Functional High Performance Financial IT
Introduction
Overview
Motivation and Background
Need for More Accurate Modelling in Mathematical Finance
Need for More Financial System and Software Transparency
Need for More Computational Performance
The Hiperfit Center
Research Goals, Organisation, and Methodology
Research Themes in Hiperfit
Functional Programming and Hiperfit
Domain-Specific Languages for Financial Applications
Parallel Functional Programming in Hiperfit
Support for Multicore and Novel Parallel Hardware
Project Start and First Activities
Conclusions
References
Data Structures
Thread-Safe Priority Queues in Haskell Based on Skiplists
Introduction
Skiplists
Concurrent Skiplist Variants
The PriorityQueue Typeclass
Lock-Based Skiplists
Software Transactional Memory Based Skiplists
Skiplists Based on Atomic Compare and Swap Operations
Testing the Implementations
Benchmarks
Additional Comparisons: Difficulty and Code Size
Related Work
Conclusion and Future Work
References
Adams' Trees Revisited
Introduction
BB- Trees
BB- Tree Operations
Rebalancing BB- Trees
Choosing the Parameters , and
Validity of w=2.5, w=3 and w=4
Correctness of a Single Rotation
Correctness of a Double Rotation
BB- Trees Height
The Performance of BB-2.5, BB-3 and BB-4 Trees
Reducing Memory by Introducing Additional Data Constructor
The Order of Data Constructors
Conclusions
Related Work
References
Miscellaneous
Functional Video Games in CS1 II
Introduction
The N-Puzzle Game
The First Encounter with the N-Puzzle Game in CS1
Finding a Solution
The Need to Remember Leads to Accumulators
Developing a Breadth-First Solution
Refining the Solution: Deriving an A*-like Algorithm
Facilitating Deployment in the Classroom
Related Work
Concluding Remarks
References
GiN: A Graphical Language and Tool for Defining iTask Workflows
Introduction
The GiN WDL
The iTask WDL
The GiN WDL
Example
The GiN Tool
The GiN Compiler
Related Work
Conclusions and Future Work
References
Applicative Shortcut Fusion
Introduction
Shortcut Fusion
Applicative Functors
Applicative Shortcut Fusion
The Datatype-Generic Formulation
Inductive Data Types
Fold
Shortcut Fusion
Extended Shortcut Fusion
Generic Traversals
Applicative Shortcut Fusion
Applicative Structural Recursion
Composite Functors
Conclusions and Future Work
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken