Papers We Love: Zürich is back!
We are grateful to Google for hosting us! Please make sure to RSVP here *and* sign up using the Google registration form (https://docs.google.com/forms/d/e/1FAIpQLSeEi3pmNkS_Le4EMaWsCFyGkMm7JxBDfU2NmrIw1VpPMWgYJg/viewform) - you'll receive a visitor badge at the event. Please fill in the form BY MARCH 24TH.
Nikolas Göbel is going to talk software complexity by guiding us through a classic, "Out of the tar pit" by Ben Moseley and Peter Marks. (https://github.com/papers-we-love/papers-we-love/blob/master/design/out-of-the-tar-pit.pdf)
Here's Nikolas' abstract for the talk:
In 2006, Ben Moseley and Peter Marks explored something that many of us are familiar with: the creeping feeling that the complexity of a software system has outgrown the complexity of the very domain it was designed to capture.
By taking a fresh look at which kinds of complexity are to be considered essential and which are merely introduced by accident, they put in words many deceptively obvious insights. Better still, they hinted at Codd's relational model and ideas from functional programming as a way out.
Unfortunately, they left implementing their approach as an exercise to the reader, calling their own ideas “purely hypothetical” and “not proven in practice”.
What were they on to? What has changed? And how deep is the tar pit today?
Nikolas is a software consultant at Clockworks and a computer science graduate at ETH Zurich.
His interest is in building systems that produce accurate answers to complex questions in near real-time,
and simplify the development of powerful, interactive applications.