addressalign-toparrow-leftarrow-rightbackbellblockcalendarcameraccwcheckchevron-downchevron-leftchevron-rightchevron-small-downchevron-small-leftchevron-small-rightchevron-small-upchevron-upcircle-with-checkcircle-with-crosscircle-with-pluscontroller-playcrossdots-three-verticaleditemptyheartexporteye-with-lineeyefacebookfolderfullheartglobegmailgooglegroupshelp-with-circleimageimagesinstagramFill 1launch-new-window--smalllight-bulblinklocation-pinm-swarmSearchmailmessagesminusmoremuplabelShape 3 + Rectangle 1ShapeoutlookpersonJoin Group on CardStartprice-ribbonprintShapeShapeShapeShapeImported LayersImported LayersImported Layersshieldstartickettrashtriangle-downtriangle-uptwitteruserwarningyahoo

Symposium Talks

Daniel Spiewak
Extreme Cleverness: Functional Data Structures in Scala

The idea is to cover the theory and implementation of data structures in Scala. We'll start out with the concept of functional persistence, look at the magic pixie dust required to integrate into the Scala Collections library, and then dive right into actual data structures. Each data structure will be motivated and built up by the associated theory and ideas. I haven't settled on a final list of structures yet, but this is what I'm thinking:

* Sequential
o Singly-linked List (makes a good intro)
+ ...with laziness
o Banker's Queue
o 2-3 Finger Tree
* Associative
o Red-Black Tree
o Hashed Patricia Trie
* Weird
o Bitmapped Vector Trie

All of these will be illustrated (with requisite colorful diagrams) and implemented with the necessary trappings to be a first-class Scala Collection. (off topic: I welcome thoughts on this list, it is by no means final) At the end of all this, I'll also spend some time talking about the constraints and implications of modern computer architecture as well as the JVM itself and the effect they have on data structure performance and design.

Jonas Bonér
Akka: Simpler Scalability, Fault-Tolerance, Concurrency & Remoting through Actors

We believe that writing correct concurrent, fault-tolerant and
scalable applications is too hard. Most of the time it's because we
are using the wrong tools and the wrong level of abstraction. Akka is
here to change that. Akka is using the Actor Model together with
Software Transactional Memory (STM) to raise the abstraction level and
provide a better platform to build correct concurrent and scalable
applications. For fault-tolerance it adopts the "Let it crash" model
which have been used with great success in the Telecom industry to
build applications that self-heal, systems that never stop. Akka's
Remote Actors, together with the Clustering module, provides the
abstraction for transparent distribution, adaptive automatic
load-balancing and cluster rebalancing, replication and is the basis
for truly scalable and fault-tolerant applications. In this talk you
will learn what Akka is, how it can be used to solve hard problems and
the ideas behind its design and implementation. Akka is available at:

Table of Contents

Page title Most recent update Last edited by
Mailing List Policy May 14, 2014 11:56 AM Nathan H.
Symposium Employers February 14, 2011 4:40 PM Dag L.
Hotels February 9, 2011 10:30 PM Josh S.
Symposium Talks December 16, 2010 12:54 PM Nathan H.
Symposium Expenses February 21, 2011 11:19 AM Nathan H.
Symposium Talk Proposals January 11, 2011 12:53 AM Nathan H.
About ny-scala January 27, 2011 5:42 PM Nathan H.

Our Sponsors

  • Yoppworks

    Pizza and Beer

  • Spotify

    An amazing Space and fridge full of beer! Thanks Spotify!

  • Canary

    A truly amazing space! Thanks Canary!

People in this
Meetup are also in:

Sign up

Meetup members, Log in

By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy