Advanced Functional Programming: 6th International School, by Koopman P. (Editor), Plasmeijer R. (Editor), Doaitse

By Koopman P. (Editor), Plasmeijer R. (Editor), Doaitse Swierstra (Editor)

This instructional publication offers seven conscientiously revised lectures given on the sixth overseas institution on sensible Programming, AFP 2008, in Heijen, The Netherlands in may perhaps 2008.The ebook offers the next seven, rigorously cross-reviewed chapters, written by way of best professionals within the box: Self-adjusting: Computation with Delta ML, spider spinning for dummies, from reduction-based to reduction-free normalization, libraries for normal programming in Haskell, dependently typed programming in agda, parallel and concurrent programming in Haskell and an iTask case examine: a convention administration approach.

Show description

Read Online or Download Advanced Functional Programming: 6th International School, AFP 2008, Heijen, The Netherlands, May 19-24, 2008, Revised Lectures PDF

Similar programming books

Learn Ruby The Hard Way (Zed Shaw's Hard Way Series)

Do you actually need to benefit programming yet haven't any ability? Are you a approach administrator who desires to examine Puppet or Chef? Are you a fashion designer who desires to construct your individual web pages? Are you a Ruby on Rails programmer who's ashamed that you simply don't fairly understand Ruby? then you definitely should still learn this booklet.

Backbone.js Blueprints

Spine. js is an open resource, JavaScript library that allows you to construct subtle and dependent net apps. It's vital to have well-organized frontend code for simple upkeep and extendability. With the spine framework, you'll have the capacity to construct functions which are a breeze to regulate.

Hadoop for Dummies

Permit "Hadoop For Dummies" support harness the facility of your information and rein within the details overloadBig info has develop into colossal enterprise, and corporations and companies of all sizes are suffering to discover how you can retrieve helpful info from their giant facts units with turning into beaten.

Additional resources for Advanced Functional Programming: 6th International School, AFP 2008, Heijen, The Netherlands, May 19-24, 2008, Revised Lectures

Example text

Carnegie Mellon University (May 2005) 3. : Imperative self-adjusting computation. In: Proceedings of the 25th Annual ACM Symposium on Principles of Programming Languages (2008) 4. : An experimental analysis of self-adjusting computation. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (2006) 5. : Adaptive Functional Programming. In: Proceedings of the 29th Annual ACM Symposium on Principles of Programming Languages, pp. 247–259 (2002) 6. : Selective memoization.

Thus, we can use modifiable lists to represent a set that changes over time. As with conventional lists, we can write various primitive list functions. Here we describe how to implement three functions on lists: lengthLessThan, map, and reduce. Omitting the self-adjusting primitives, the first two functions are nearly identical to their conventional counterparts and therefore have comparable asymptotic complexity; the complexity of reduce is discussed below. In our implementation, we observe the following convention.

Another example is Minimum Spanning Trees (MST), whose dynamic version has required more than a decade of research to solve efficiently [34,31,41,40,44], while its static/conventional version is straightforward. Other examples include the problem of dynamic trees, whose various flavors have been studied extensively [63,64,26,56,40,68,17,35,18,67,66]. Because dynamic algorithms are designed to support a particular set of modifications, they are highly specialized (an algorithm may be efficient for some modifications to data but not others), naturally more complex than their static versions, and are not composable (Section 2).

Download PDF sample

Rated 4.18 of 5 – based on 50 votes