The Philadelphia chapter of Papers We Love
What was the last paper within the realm of computing you read and loved? What did it inspire you to build or tinker with? Come share the ideas in an awesome academic/research paper with fellow engineers, programmers, and paper-readers. Lead a session and show off code that you wrote that implements these ideas or just give us the lowdown about the paper. Otherwise, just come, listen, and discuss in a low ego, friendly environment.
Papers We Love has a Code of Conduct. Please contact one of the Meetup's organizers if anyone is not following it. Be good to each other and to the PWL community!
Sign-up: Please RSVP for meetings via Meetup.com
Harvest, Yield, and Scalable Tolerant Systems and Cluster-Based Scalable Network Services
The CAP theorem is one of the defining blocks of how we talk about and build distributed systems. We use its tenets to understand how a system is going to behave in the case of failure and what kind of measures we can take to prevent or alleviate them. We'll learn how it came to be and why it's still so important today, especially when dealing with servers and services in the cloud.
This lecture will not assume any background in distributed systems research from the audience.
Food and drinks will be available at 6:30PM and the talk will start at 7PM.
Harvest, Yield, and Scalable Tolerant Systems paper: h…
From System F to Typed Assembly Language
by Greg Morrisett, David Walker, Karl Crary and Neal Glew
We motivate the design of a typed assembly language (TAL) and present a type-preserving translation from System F to TAL. The typed assembly language we present is based on a conventional RISC assembly language, but its static type system provides support for enforcing high-level language abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the typing constructs admit many low-level compiler optimizations. Our translation to TAL is specified as a sequence of type-preserving transformations, including CPS and closure conversion phases; type-correct source programs are mapped to type-correct assembly language. A key contribution is an approach to polymorphic closure conversion that is considerably simpler than previous work. The …
Thanks to PromptWorks for hosting, and Comcast for the food!…