Adapting and assembling components using Cake, a language of interface relations

Add to your list(s) Download to your calendar using vCal

• Stephen Kell (University of Cambridge)
• Thursday 07 October 2010, 16:00-17:00
• FW26, Computer Laboratory, William Gates Builiding.

If you have a question about this talk, please contact Eiko Yoneki.

There is little tool support for composing software components whose interfaces do not match, yet this arises often. Observing the typical benefits and drawbacks of glue coding, I will outline the design of Cake, a rule-based language for describing black-box compositions of native binary components whose interfaces do not match. I will discuss briefly the implementation of the Cake compiler, which generates adaptation logic, and the Cake runtime, which addresses binary compatibility issues. Finally I will describe experiences applying Cake to three real use-cases drawn from open-source code, illustrating how the Cake code is shorter, simpler and better modularised than conventional implementations.

This is a practice talk for SPLASH / OOPSLA 2010.

This talk is part of the Computer Laboratory Systems Research Group Seminar series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• CL's SRG seminar
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Computer Laboratory Systems Research Group Seminar
• Department of Computer Science and Technology talks and seminars
• FW26, Computer Laboratory, William Gates Builiding
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.