Notice Notice 1: All new recordings are now only available in the New Curtin iLecture EchoSystem

As of July 9th 2012, all new recordings are only available in the new Curtin iLectures EchoSystem.

Existing recordings in this old Lectopia system will remain available till 31st of December 2013 after which time these legacy servers will be turned off.

Old recordings that need to be kept online should be downloaded and then uploaded into the new EchoSystem.

More Info:

- 5 things you need to know about iLecture

- Getting ready for the new iLecture system

- New iLecture System HowTos
09 Jul 2012 16:47
Notice Notice 2: iPad, iPhone & iPod Touch Users!

iPad and iPhone users can stream all iLecture recordings that were published from mid-2011 onwards over 3G or WiFi.

All recordings dated earlier than mid-2011 are not available for streaming over the air to iOS devices, but all those earlier recordings that have downloadable or podcast formats available can be downloaded to your PC or Mac and synched in iTunes onto your mobile Apple device.

You can also subscribe to podcasts using a third party podcast catcher (eg iCatcher!) to download mp3 or iPod video podcasts directly onto your device.

Another option is to install a 3rd Party web browser (eg iCab Mobile) onto the iPhone/iPad/iPod that can change its user agent to something other than Safari Mobile. This will allow all media options to appear including the downloadable iPod video format which you can then view in your browser.
 27 Feb 2012

Showing items 1 through 1 of 1.


help & software requirements

Podcast subscribe to this podcast

 20 Jan 2011 - 09:00

105 mins 21 hits rating=1.0
Topic:  Keynote: Computing with Capsules
Speaker:  Prof. Dexter Kozen Cornell University
Outline:  Capsules provide a clean algebraic representation of the state of a computation in higher-order functional and imperative languages with mutable bindings. Capsules play the same role as closures or heap- or stack-allocated environments but are much simpler. A capsule is essentially a syntactic representation of a finite coalgebra representing a regular closed lambda-coterm.

In this talk I will describe a simple higher-order programming language with functional and imperative features, including mutable bindings, based on capsules. For computational purposes, all operations of interest are typable with simple types, yet the system is Turing complete. Recursive functions are represented directly as capsules, eliminating the need for unnatural fixpoint combinators that are untypable with simple types and impose a call-by-name discipline.

I will give an operational semantics for the language and show that it correctly captures lexical scoping without any combinatorial constructs such as stacks, heaps, or closures.
Related site:  http://www.cs.cornell.edu/~kozen
Known issues:  Presentation starts at 1 min 50 seconds
Streaming:
flash

Flash
open
quicktime

QuickTime
open
windowsmedia

Windows Media
open
Download:
download

Media
open
 Report a problem with this recording