[PRL] Fwd: [Programming] Dana Scott: Wed at 1pm

[Aaron Turon]

There's a lot of interest in Dana Scott's talk, so we'll postpone our seminar.

Scheduling is complicated by the hiring talk schedule, so we'll need
to hold the seminar on a nonstandard day/time -- but it's important to
hold it soon, to give Vincent feedback for the paper he's working on.

Please register your scheduling preferences for Monday 2/21 and Friday
2/25 using this link:

    http://doodle.com/e993xrpbcf5smmhr

On Mon, Feb 14, 2011 at 10:31 AM, Aaron Turon <turon at ccs.neu.edu> wrote:
> We've currently got Vincent scheduled for a PL seminar talk on the
> 16th -- but how many people would also like to see Dana Scott's talk?
> It may make sense to postpone our seminar and take a lab field trip.
>
> Please email me (not the PRL list) if you're interested in this talk,
> and I'll see what can be worked out.
>
> On Mon, Feb 14, 2011 at 10:25 AM, David Van Horn <dvanhorn at ccs.neu.edu> wrote:
>>
>>
>> -------- Original Message --------
>> Subject: [Programming] Dana Scott:  Wed at 1pm
>> Date: Mon, 14 Feb 2011 09:44:42 -0500
>> From: Greg Morrisett <greg at eecs.harvard.edu>
>> To: programming at eecs.harvard.edu,       Leslie Valiant
>> <Valiant_Leslie at seas.harvard.edu>,      Harry Lewis <lewis at seas.harvard.edu>,
>> Salil Vadhan <salil at seas.harvard.edu>
>> CC: Andrew and Kavita Myers <andru at cs.cornell.edu>,     Martin Rinard
>> <rinard at csail.mit.edu>, Olin Shivers <shivers at ccs.neu.edu>,     Dan Grossman
>> <djg at cs.washington.edu>, Dana Scott <dana.scott at cs.cmu.edu>,    Mitchell
>> Wand <wand at ccs.neu.edu>
>>
>> Dana Scott will be giving a talk in the Harvard PL seminar this
>> Wednesday (Feb 16) at 1pm in Maxwell Dworkin Hall room 319.
>> The title and abstract are below.
>>
>>> Speaker: Dana Scott (Carnegie Mellon and Berkeley)
>>> Title: "Semilattices, Domains, and Computability"
>>>
>>> Abstract:  One popular notion of a (Scott-Ersov)
>>> domain is defined as a bounded complete algebraic
>>> cpo. Such an abstract a definition is not always
>>> so helpful for beginners.  The speaker found
>>> recently that there is an easy-to-construct domain
>>> of countable semilattices giving isomorphic
>>> copies of all countably based domains. This approach
>>> seems to have advantages over both the so-called
>>> "information systems" and the more abstract lattice/
>>> topological definitions, and it makes the finding
>>> of solutions to domain equations and models for the
>>> lambda-calculus very elementary to justify.  The
>>> "domain of domains" also has a natural computable
>>> structure in this formulation.  Built on top of this
>>> construction is a modeling of Martin-Löf type theory.
>>
>> _______________________________________________
>> Programming mailing list
>> Programming at eecs.harvard.edu
>> https://lists.eecs.harvard.edu/mailman/listinfo/programming
>>
>> _______________________________________________
>> PRL mailing list
>> PRL at lists.ccs.neu.edu
>> https://lists.ccs.neu.edu/bin/listinfo/prl
>>
>