1. Keynote

Mon 8:30-9:45 am - Genoa
The impending ordinariness of teaching concurrent programming
Doug Lea, SUNY Oswego, United States

The process of infiltrating Computer Science and Software Curricula with instruction on concurrent programming is similar to those that occurred with object-oriented programming and design patterns over the past two decades. Some basic ideas of parallelism (for example operations on aggregates including map and reduce) are becoming routine alternatives to sequential loops and can be introduced very early in the curriculum. Similarly, some uses of actors extend event-based programming. And coverage of concurrent data structures and algorithms such as non-blocking queues is appropriate in courses covering other non-obvious data structures such as B-Trees.

 

2009 Highlights

Barbara Liskov

In a reprise of her ACM Turing Award lecture, Barbara Liskov discusses the invention of abstract data types, the CLU programming language, clusters, polymorphism, exception handling, iterators, implementation inheritance, type hierarchies, the Liskov Substitution Principle, polymorphism, and future challenges such as new abstractions, parallelism, and the Internet.

Watch the video on InfoQ.

More Highlights