From wand at ccs.neu.edu  Tue Jan  5 10:02:41 2010
From: wand at ccs.neu.edu (Mitchell Wand)
Date: Tue, 5 Jan 2010 10:02:41 -0500
Subject: [PRL] Peter Lee on his new role at DARPA (@MIT on Wed)
Message-ID: <1bd18ad51001050702n166131afv80b7ecf467f92c06@mail.gmail.com>

---------- Forwarded message ----------
From: <seminars-request at lists.csail.mit.edu>
Date: Tue, Jan 5, 2010 at 9:00 AM
Subject: [temp] Seminars Digest, Vol 85, Issue 2
To: seminars at lists.csail.mit.edu


From: CSAIL Event Calendar <eventcalendar at csail.mit.edu>
To: seminars at csail.mit.edu
Date: Mon, 04 Jan 2010 12:44:28 -0500
Subject: TALK:Wednesday 1-6-10 DARPA/TCTO Overview ("Peter at DARPA")

DARPA/TCTO Overview ("Peter at DARPA")
Speaker: Peter Lee
Speaker Affiliation: DARPA Transformational Convergence Technology Office
(TCTO)
Host: Victor Zue
Host Affiliation: CSAIL

Date: 1-6-2010
Time: 11:00 AM - 12:00 PM
Location: 32-G449/Patil Conference Room

 Peter Lee has been a faculty member and, most recently, Head of the
Computer
Science Department at Carnegie Mellon University.  Three months ago, he
began
a stint at DARPA as the Director of the new Transformational Convergence
Technology Office (DARPA/TCTO).  TCTO?s mission is to develop research
programs that enhance the nation?s ability to anticipate strategic surprise.
 It does this by re-establishing basic research programs in a broad range of
rapidly emerging computing-enabled technology areas such as social media,
synthetic biology, high-performance computing, and networking, as well as
employing a diverse range of innovation strategies including broad community
programs, competitions/challenges, and crowd sourcing.  In this talk, Dr.
Lee
will give an overview of TCTO?s mission, research areas, and approaches to
technology innovation.

Relevant URL(S):
For more information please contact: Victoria Palay, 617.253.8924,
palay at csail.mit.edu
-------------- next part --------------
HTML attachment scrubbed and removed

From wand at ccs.neu.edu  Fri Jan  8 15:42:17 2010
From: wand at ccs.neu.edu (Mitchell Wand)
Date: Fri, 8 Jan 2010 15:42:17 -0500
Subject: [PRL] How Pair Programming Really Works
Message-ID: <1bd18ad51001081242je73b2f8t567e6f8d0e64fc41@mail.gmail.com>

Or more precisely: four theories as to *why* it works.  I wonder which of
these could be fostered in our classes.   Any thoughts?   --Mitch

http://www.ccs.neu.edu/home/wand/private/how-pair-programming-really-works.pdf
-------------- next part --------------
HTML attachment scrubbed and removed

From dherman at ccs.neu.edu  Sat Jan  9 15:43:39 2010
From: dherman at ccs.neu.edu (David Herman)
Date: Sat, 9 Jan 2010 12:43:39 -0800
Subject: [PRL] point-free set notation
Message-ID: <95E2A8FC-FFCD-4D0C-9BFD-DF02438B2184@ccs.neu.edu>

In Haskell, you can curry a binary operator to define a function  
without naming the missing argument:

     (+n) === \m -> (m+n)

Is there an analogous notation in math for constructing a set based on  
a binary relation with an omitted element? For example, I'd like to be  
able to define the set of integers > n like:

     { -- > n } === { m | m > n }

or something like that. (I'm aware that generally this is a type- 
ambiguous notation, but for my purposes the meta-variables involved  
are enough to disambiguate.)

Thanks,
Dave



From turon at ccs.neu.edu  Sat Jan  9 16:19:03 2010
From: turon at ccs.neu.edu (Aaron Turon)
Date: Sat, 9 Jan 2010 16:19:03 -0500
Subject: [PRL] point-free set notation
In-Reply-To: <95E2A8FC-FFCD-4D0C-9BFD-DF02438B2184@ccs.neu.edu>
References: <95E2A8FC-FFCD-4D0C-9BFD-DF02438B2184@ccs.neu.edu>
Message-ID: <aac3b4681001091319o4a8b1b0axf7e78c11bb9cd42a@mail.gmail.com>

It sounds like you want the relational image.  If R is a binary
relation and X is a set, then RX = {a : a R b, b in X} and XR = {b : a
R b, a in X}.

So for your example you could write (>){n}, often abbreviated by >n
when the types are clear.

On Sat, Jan 9, 2010 at 3:43 PM, David Herman <dherman at ccs.neu.edu> wrote:
> In Haskell, you can curry a binary operator to define a function
> without naming the missing argument:
>
> ? ? (+n) === \m -> (m+n)
>
> Is there an analogous notation in math for constructing a set based on
> a binary relation with an omitted element? For example, I'd like to be
> able to define the set of integers > n like:
>
> ? ? { -- > n } === { m | m > n }
>
> or something like that. (I'm aware that generally this is a type-
> ambiguous notation, but for my purposes the meta-variables involved
> are enough to disambiguate.)
>
> Thanks,
> Dave
>
>
> _______________________________________________
> PRL mailing list
> PRL at lists.ccs.neu.edu
> https://lists.ccs.neu.edu/bin/listinfo/prl
>


From dherman at ccs.neu.edu  Sat Jan  9 16:33:32 2010
From: dherman at ccs.neu.edu (David Herman)
Date: Sat, 9 Jan 2010 13:33:32 -0800
Subject: [PRL] point-free set notation
In-Reply-To: <aac3b4681001091319o4a8b1b0axf7e78c11bb9cd42a@mail.gmail.com>
References: <95E2A8FC-FFCD-4D0C-9BFD-DF02438B2184@ccs.neu.edu>
	<aac3b4681001091319o4a8b1b0axf7e78c11bb9cd42a@mail.gmail.com>
Message-ID: <9F6E1985-B6D5-47A6-8990-455EB2D205D7@ccs.neu.edu>

I assume that notation works on both sides? So:

     {n}(>) = {m | n > m}
     (>){n} = {m | m > n}

Thanks,
Dave

On Jan 9, 2010, at 1:19 PM, Aaron Turon wrote:

> It sounds like you want the relational image.  If R is a binary
> relation and X is a set, then RX = {a : a R b, b in X} and XR = {b : a
> R b, a in X}.
>
> So for your example you could write (>){n}, often abbreviated by >n
> when the types are clear.
>
> On Sat, Jan 9, 2010 at 3:43 PM, David Herman <dherman at ccs.neu.edu>  
> wrote:
>> In Haskell, you can curry a binary operator to define a function
>> without naming the missing argument:
>>
>>     (+n) === \m -> (m+n)
>>
>> Is there an analogous notation in math for constructing a set based  
>> on
>> a binary relation with an omitted element? For example, I'd like to  
>> be
>> able to define the set of integers > n like:
>>
>>     { -- > n } === { m | m > n }
>>
>> or something like that. (I'm aware that generally this is a type-
>> ambiguous notation, but for my purposes the meta-variables involved
>> are enough to disambiguate.)
>>
>> Thanks,
>> Dave
>>
>>
>> _______________________________________________
>> PRL mailing list
>> PRL at lists.ccs.neu.edu
>> https://lists.ccs.neu.edu/bin/listinfo/prl
>>



From matthias at ccs.neu.edu  Sun Jan 17 09:38:44 2010
From: matthias at ccs.neu.edu (Matthias Felleisen)
Date: Sun, 17 Jan 2010 09:38:44 -0500
Subject: [PRL] Fwd: [TYPES/announce] Two phase reviewing for POPL; a response
References: <C94BAF98-66C7-48DA-BBA9-CD1E8E0B318D@ccs.neu.edu>
Message-ID: <5A5804B1-D578-4770-839E-A285C60350F3@ccs.neu.edu>


If you have ever submitted to POPL, here is your chance to let the SC know what your thoughts are about the review and decision process -- Matthias



Begin forwarded message:

> From: Matthias Felleisen <matthias at ccs.neu.edu>
> Date: January 15, 2010 3:04:12 PM EST
> To: Simon Peyton-Jones <simonpj at microsoft.com>, types-announce at lists.seas.upenn.edu
> Cc: Philip Wadler <wadler at inf.ed.ac.uk>
> Subject: Re: [TYPES/announce] Two phase reviewing for POPL; a response
> 
> 
> Dear typists, as many of you know Jens Palsberg sent out
> a brief survey to the authors of POPL 2010 submissions on
> behalf of the SC.
> 
> Several expressed a dislike for non-anonymous surveys
> and others pointed out that they didn't submit this
> year but are otherwise regular authors. Phil asked me
> to create a surveymonkey survey and I did by copying
> and pasting Jens's questions into a web page:
> 
> http://www.surveymonkey.com/s/ZLJF6VG
> 
> I still have to figure out how to get the results
> back but in the meantime, fire away.
> 
> -- Matthias
> 



From dvanhorn at ccs.neu.edu  Wed Jan 27 14:55:39 2010
From: dvanhorn at ccs.neu.edu (David Van Horn)
Date: Wed, 27 Jan 2010 14:55:39 -0500
Subject: [PRL] POPL photos
Message-ID: <4B609A3B.20505@ccs.neu.edu>

http://www.flickr.com/photos/dvanhorn/sets/72157623171910441/

Some photos from the Principles of Programming Languages Conference of 
2010 in Madrid, Spain.


From wand at ccs.neu.edu  Fri Feb  5 16:18:26 2010
From: wand at ccs.neu.edu (Mitchell Wand)
Date: Fri, 5 Feb 2010 16:18:26 -0500
Subject: [PRL] Fwd: [temp] Seminars Digest, Vol 86, Issue 3
In-Reply-To: <mailman.0.1265378401.15455.seminars@lists.csail.mit.edu>
References: <mailman.0.1265378401.15455.seminars@lists.csail.mit.edu>
Message-ID: <1bd18ad51002051318o48790f5cvb7863f63eed590bf@mail.gmail.com>

Possibly of interest....

---------- Forwarded message ----------
From: <seminars-request at lists.csail.mit.edu>
Date: Fri, Feb 5, 2010 at 9:00 AM
Subject: [temp] Seminars Digest, Vol 86, Issue 3
To: seminars at lists.csail.mit.edu


From: Csail Event Calendar <eventcalendar at csail.mit.edu>
To: seminars at csail.mit.edu
Date: Fri, 05 Feb 2010 00:01:02 -0500
Subject: TALK:Friday 2-12-10 PRAGMATIC TYPESTATE VERIFICATION WITH
PERMISSIONS

PRAGMATIC TYPESTATE VERIFICATION  WITH PERMISSIONS
Speaker: Jonathan Aldrich
Speaker Affiliation: Carnegie Mellon University
Host: Martin Rinard
Host Affiliation: MIT-CSAIL

Date: 2-12-2010
Time: 2:00 PM - 3:00 PM
Refreshments: 1:45 PM
Location: 32-D463, Star Conference Room

ABSTRACT
Object-oriented libraries often define usage protocols that clients must
follow in order for the system to work properly.  These protocols may be
poorly documented and difficult to follow, causing errors and significant
lost
productivity in software development.

We are exploring a new approach to verifying object protocols using
permissions.  These permissions track not only the current "typestate" of an
object in its protocol, but an abstraction of what operations other aliases
might perform on the object and what invariants must remain true. Developers
annotate their code with state and permission information, which can be
automatically and soundly checked for consistency.  Our approach is fully
modular, yet allows substantial reasoning about objects even when they are
aliased by multiple clients.  I will discuss extensions to check protocols
in
concurrent systems, our practical experience with the system, and current
work
toward a new programming language based on typestate.

BIO
Jonathan Aldrich is Associate Professor of Computer Science at Carnegie
Mellon University.  He is the director of CMU's undergraduate minor program
in
Software Engineering, and teaches courses in programming languages, software
engineering and program analysis. Dr. Aldrich joined the CMU faculty after
completing a Ph.D. at the University of Washington and a B.S. at Caltech.

Aldrich's research contributions include verifying architectural structure
and secure information flow, modular formal reasoning about code, and API
protocol safety.  For his work on architecture and information flow, Aldrich
received a 2006 NSF CAREER award and the 2007 Dahl-Nygaard Junior Prize,
given
annually for a significant technical contribution to object-oriented
programming.

Relevant URL(S):
For more information please contact: Mary McDavitt, 617-253-9620,
mmcdavit at csail.mit.edu
-------------- next part --------------
HTML attachment scrubbed and removed

From turon at ccs.neu.edu  Mon Feb  8 11:59:23 2010
From: turon at ccs.neu.edu (Aaron Turon)
Date: Mon, 8 Feb 2010 11:59:23 -0500
Subject: [PRL] Meeting with Ken Shan
Message-ID: <aac3b4681002080859n1071b9a7m10f858414e90dca7@mail.gmail.com>

Ken (Chung-chieh) Shan will be here giving a talk on Wed 2/10 (see the
PL-Seminar announcement).  He plans to stay for lunch and through the
afternoon for meetings.  Please let me know if you're interested in
meeting with Ken, and if so what your time constraints are for Wed
afternoon.

Thanks,
Aaron


From dvanhorn at ccs.neu.edu  Tue Feb  9 18:15:59 2010
From: dvanhorn at ccs.neu.edu (David Van Horn)
Date: Tue, 09 Feb 2010 18:15:59 -0500
Subject: [PRL] Tufts, Thurs: Combining Static and Dynamic Typing in Ruby
Message-ID: <4B71ECAF.7010204@ccs.neu.edu>

This is probably of interest to some of the PRL.  -- David

http://www.cs.tufts.edu/colloquia/current/?event=615

Speaker: Jeff Foster, University of Maryland, Harvard University 
(sabbatical)

Abstract

Many popular scripting languages are dynamically typed. Dynamic typing 
provides many benefits, but it comes at a price: Programming mistakes 
that would easily be caught by static typing remain latent until run 
time, when they can be hard to track down and expensive to fix. In this 
talk, we will discuss Diamondback Ruby (DRuby), a research project that 
blends static and dynamic typing for Ruby. Our aim is to add a typing 
discipline that is simple for programmers to use, flexible enough to 
handle common idioms, that provides programmers with additional checking 
where they want it, and reverts to run-time checks where necessary. 
DRuby includes the Ruby Intermediate Language, a parser and front-end 
for Ruby; a static type language that is similar to the typing notation 
in the informal documentation for Ruby; a static type inference 
algorithm; a profiling-based analysis algorithm to handle 
hard-to-analyze dynamic constructs such as "eval"; interface files for 
modules; and an extension for analysis of Ruby-on-Rails code. We will 
discuss these features of DRuby and their evaluation, as well as lessons 
learned in working with scripting languages in general, and Ruby in 
particular. We will end by discussing future directions, including a 
symbolic execution engine for Ruby and user studies to better understand 
the use of types in programming.

Joint work with Mike Furr, Jong-hoon (David) An, Mike Hicks, Mark Daly, 
Avik Chaudhuri, and Ben Kirzhner.


From wand at ccs.neu.edu  Thu Feb 11 19:25:41 2010
From: wand at ccs.neu.edu (Mitchell Wand)
Date: Thu, 11 Feb 2010 19:25:41 -0500
Subject: [PRL] Fwd: TP Msg. #998 Writing a Statement of Teaching Philosophy
	for the Academic Job Search
In-Reply-To: <p06240800c79a455fbdb1@171.64.49.172>
References: <p06240800c79a455fbdb1@171.64.49.172>
Message-ID: <1bd18ad51002111625u59c0afeehbd2cdbc3b07ce225@mail.gmail.com>

---------- Forwarded message ----------
From: Rick Reis <reis at stanford.edu>
Date: Thu, Feb 11, 2010 at 6:39 PM
Subject: TP Msg. #998 Writing a Statement of Teaching Philosophy for the
Academic Job Search
To: tomorrows-professor at lists.stanford.edu


As these recent job ads illustrate, requests for teaching philosophies are
common in the academic market. In fact, a survey of 457 search committee
chairs in six disciplines (English, history, political science, psychology,
biology, and chemistry) found that 57% requested a teaching statement at
some point in a job search (Meizlish & Kaplan, in press).
----------------------------------------------------------------------------------------------------------------------
                                               TOMORROW'S PROFESSOR(sm)
eMAIL NEWSLETTER

http://cgi.stanford.edu/~dept-ctl/cgi-bin/tomprof/postings.php<http://cgi.stanford.edu/%7Edept-ctl/cgi-bin/tomprof/postings.php>


     Sponsored by
                                                   Stanford Center for
Teaching and Learning

http://ctl.stanford.edu


 Posting comments

http://tomprofblog.mit.edu/

Folks:

The posting below is an excerpt on some key points to pay attention to in
writing a teaching philosophy statement.  It is by Chris O'Neal, Deborah
Meizlish, and Matthew Kaplan* and is from the Occasional Paper series (#23)
published by the Center for Research on Learning and Teaching (CRLT) [
http://www.crlt.umich.edu/] at the University of Michigan.THE FULL ARTICLE
CAN BE FOUND AT:
http://www.crlt.umich.edu/publinks/CRLT_no23.pdf Copyright 2007 The
University of Michigan. Reprinted with permission.

Regards,

Rick Reis
reis at stanford.edu
UP NEXT: The Need for (Em)powerful Teaching

                                                   Tomorrow's Graduate
Students and Postdocs

         -------------------------------------------- 1,268 words
-------------------------------------------

                         Writing a Statement of Teaching Philosophy for the
Academic Job Search

       Domestic Environmental Policy and Politics.
       Lehigh University's yearold Environmental Initiative seeks an
Assistant
       Professor for a tenure track position? To apply, please send a
       cover letter, current curriculum vitae, syllabi and other
       evidence of teaching style and  effectiveness, a statement of
teaching
       philosophy, a sample of  scholarship (if available) and three letters
       of reference.

       Assistant Professor (tenure track) Specialization in African and Post
       Colonial Literatures?. Send letter of application, curriculum vitae,
statement of teaching
       philosophy, graduate school transcript, and three letters of
recommendation? Northeastern
       Illinois University is an affirmative action, equal opportunity
employer.

       LSU's Department of Chemistry (chemistry.lsu.edu) anticipates filling
one or two tenure-track
       positions in the fields of NMR Spectroscopy  (Ref: Log #0184) and
Physical Chemistry (Ref: Log
       #0186), broadly defined?. Applications should consist of a research
proposal, a statement of
       teaching philosophy, and a curriculum vitae (including  address).
Applicants should arrange for
       submission of three letters of recommendation.

Introduction

As these recent job ads illustrate, requests for teaching philosophies are
common in the academic market. In fact, a survey of 457 search committee
chairs in six disciplines (English, history, political science, psychology,
biology, and chemistry) found that 57% requested a teaching statement at
some point in a job search (Meizlish & Kaplan, in press). These results
differed slightly by institutional type, with master's and bachelor's
institutions requesting them more often than doctoral institutions. Results
also differed by discipline. Surprisingly, requests for teaching
philosophies were most frequent in the natural sciences. But the overall
message is clear: job applicants in all fields may be asked to submit a
teaching philosophy (see also Bruff, in press; Montell, 2003; Sch?nwetter,
Taylor, & Ellis, 2006).

Teaching philosophies can serve several purposes (e.g., self-reflection,
introduction to a teaching portfolio, communication with students), but we
focus here on those written for academic job applications. Such statements
communicate a job candidate's approach to teaching and learning to a faculty
considering whether to make that candidate one of their colleagues. Since a
committee cannot possibly observe the teaching of every applicant, the
teaching philosophy helps search committee members imagine themselves in
each candidate's classroom. What is it like to be one of this instructor's
students? Why does she make the pedagogical decisions she does? As a student
in this classroom, how would I spend my fifty minutes on a given day? How
does the instructor address the challenges and resources of teaching in his
particular discipline? Does her teaching style complement our department's
philosophy of instruction?

This Occasional Paper is designed to help experienced graduate students
write a statement of teaching philosophy. The paper contains four sections.
First, we offer suggestions for making a philosophy of teaching explicit and
getting it on paper. Second, we discuss research on characteristics of
effective statements. Third, we introduce a rubric that can guide the
development and crafting of a teaching statement that search committees will
value. Finally, we address questions that job candidates often raise about
this sometimes perplexing document.

Advice for Getting Started

Just because you have never written a statement of your teaching philosophy
does not mean you do not have a
philosophy. If you engage a group of learners who are your responsibility,
then your behavior in designing their
learning environment must follow from your philosophical orientation?. What
you need to do is discover what [your philosophy] is and then make it
explicit. (Coppola, 2000, p. 1)

Beginning the teaching philosophy is often the hardest part of writing one.
The motivations behind the decisions we make in the classroom can be
surprisingly elusive when we try to put them on paper. Since there is no
single approach that will work for all writers, we offer three strategies
for getting started:

1. Goodyear and Allchin (1998) found that thinking about the "big" questions
of teaching helped instructors
articulate their philosophies:
* What motivates me to learn about this subject?
* What do I expect to be the outcomes of my teaching?
* How do I know when I've taught successfully?

2. In workshops and seminars at U-M, we have found that some graduate
students prefer to approach a statement by thinking about more concrete and
manageable "fragments" of teaching that can then be assembled into a
holistic essay. The following questions are designed to get you started:
* Why do you teach?
* What do you believe or value about teaching and student learning?
* If you had to choose a metaphor for teaching/learning, what would it be?
* How do your research and disciplinary context influence your teaching?
* How do your identity/background and your students' identities/backgrounds
affect teaching and learning in
your classes?
* How do you take into account differences in student learning styles in
your teaching?
* What is your approach to evaluating and assessing students?

3. Finally, some instructors find it most useful to begin by simply looking
at examples of others' philosophies.
CRLT has posted sample statements from a variety of disciplines at <
http://www.crlt.umich.edu/tstrategies
/tstpum.html <http://www.crlt.umich.edu/tstrategies%0A/tstpum.html>>. When
looking at others' philosophies, you will likely note considerable
variation, both in terms
of content and format, and you will likely find some approaches that
resonate with you. While there is no
single approach to a teaching philosophy, Figure 1 provides some general
guidelines for those statements written for the academic job market.

----------
Figure 1. Some general guidelines for writing the teaching philosophy
(adapted from Chism, 1998):
       * Keep it brief (1-2 pages).
       * Use a narrative, first person approach.
       * Make it reflective and personal.
       * Discuss your goals for your students, the methods you use to
achieve those goals, and the
          assessments you use to find out if students have met your
expectations.
       * Explain your specific disciplinary context and use specific
examples of your practice.
       * Showcase your strengths and accomplishments.
----------

Once you've articulated a first draft, you can begin shaping and polishing
it for the search committees who will be reading it. In the following
section, we discuss characteristics of successful teaching philosophy
statements and provide a rubric for evaluating a teaching statement and
aiming it at the right audience.

What Constitutes a Good Statement?

In their survey of search committee chairs, Meizlish and Kaplan (in press)
found broad agreement on the
desirable characteristics of a statement of teaching philosophy.
Specifically, chairs described successful
teaching statements as having the following characteristics:

* They offer evidence of practice. Search committee chairs want to
understand how candidates enact their
teaching philosophies. In particular, they want to see specific and personal
examples and experiences rather
than vague references to educational jargon or formulaic statements.

* They convey reflectiveness. Search committees want to know that a
candidate is a thoughtful instructor. They are interested in candidates who
can discuss their approach to instructional challenges and their plans for
future pedagogical development.

* They communicate that teaching is valued. Search chairs appreciate a tone
or language that conveys a
candidate's enthusiasm and commitment to teaching. They are wary of
candidates who talk about teaching as
a burden or a requirement that is less important than research.

* They are student- or learning-centered, attuned to differences in student
abilities, learning styles, or
levels. Search committee chairs want concrete evidence of a candidate's
attentiveness to student
learning (rather than just content) and awareness of and ability to deal
with student differences in the classroom.

* They are well written, clear, and readable. Search chairs draw conclusions
about candidates from all
elements of the application packet. Candidates can be undermined by
carelessness in their teaching
statements.

Note again  that the full article can be found at:
http://www.crlt.umich.edu/publinks/CRLT_no23.pdf


References
Bruff, Derek (in press). Valuing and evaluating teaching in the
mathematics faculty hiring process. Notices of the American
Mathematical Society.

Chism, N. V. N. (1998). Developing a philosophy of teaching statement.
Essays on Teaching Excellence 9(3). Athens, GA: Professional and
Organizational Development Network in Higher Education.

Cohen, S. A. (1987). Instructional alignment: Searching for a magic
bullet. Educational Research, 16(8), 16-20.

Coppola, B. (2000). How to write a teaching philosophy for academic
employment. American Chemical Society (ACS) Department of
Career Services Bulletin.

Goodyear, G. E., & Allchin, D. (1998). Statements of teaching
philosophy. In M. Kaplan & D. Lieberman (Eds.), To Improve the
Academy: Resources for Faculty, Instructional, and Organizational
Development, Vol. 17 (pp. 103-122). Stillwater, OK: New Forums
Press.

Gurin, P. (1999). Expert testimony in Gratz, et al. v. Bollinger, et al. &
Grutter, et al. v. Bollinger, et al., in The Compelling Need for
Diversity in Higher Education. Retrieved August 20, 2007 from
http://www.umich.edu/~urel/admissions/legal/expert/gurintoc.html<http://www.umich.edu/%7Eurel/admissions/legal/expert/gurintoc.html>

Kaplan, M. (1998). The teaching portfolio. Occasional Paper No. 11.
Ann Arbor, MI: Center for Research on Learning and Teaching,
University of Michigan.

Kardia, D. (1998). Becoming a multicultural faculty developer:
Reflections from the field. In M. Kaplan & D. Lieberman (Eds.), To
Improve the Academy: Resources for Faculty, Instructional, and
Organizational Development, Vol. 17 (pp. 15-33). Stillwater, OK:
New Forums Press.

Meizlish, D., & Kaplan, M. (in press). Valuing and evaluating teaching in
academic hiring: A multi-disciplinary, cross-institutional study.
Journal of Higher Education.

Montell, G. (2003, March 27). What's your philosophy on teaching, and
does it matter? The Chronicle of Higher Education, Chronicle
Careers. Retrieved January 15, 2007, from
http://chronicle.com/jobs/2003/03/2003032701c.htm

Sch?nwetter, D. J., Taylor, L., & Ellis, D. E. (2006). Reading the want
ads: How can current job descriptions inform professional
development programs for graduate students? Journal on
Excellence in College Teaching, 17(1&2), 159-188.


*Chris O'Neal is Senior Consultant for Institutional Initiatives at the
Center for Research on Learning and Teaching (CRLT). Deborah Meizlish is
Coordinator of Social Science Initiatives at CRLT. Matthew Kaplan is
Managing Director of CRLT. They have Ph.D.s in Biology, Political Science,
and Comparative Literature, respectively.

*       *       *       *       *       *       *
NOTE: Anyone can SUBSCRIBE to the Tomorrows-Professor Mailing List by going
to:
https://mailman.stanford.edu/mailman/listinfo/tomorrows-professor
--++**==--++**==--++**==--++**==--++**==--++**==--++**==
tomorrows-professor mailing list
tomorrows-professor at lists.stanford.edu
https://mailman.stanford.edu/mailman/listinfo/tomorrows-professor
-------------- next part --------------
HTML attachment scrubbed and removed

From paul.stansifer at gmail.com  Fri Feb 12 16:43:49 2010
From: paul.stansifer at gmail.com (Paul Stansifer)
Date: Fri, 12 Feb 2010 21:43:49 +0000
Subject: [PRL] summer internship at Endeca
Message-ID: <d4c4547a1002121343l636d66j2da3a7ea7ddab1f4@mail.gmail.com>

The company I worked for before coming here, Endeca Technologies, is looking
for interns this summer.  I thoroughly enjoyed my time there, and they even
do somewhat PL-related work, so you might be interested.  (My team was
building a compiler from XQuery to a custom relational language.)  Their
(not terribly informative) website is http://endeca.com.  If you'd like me
to refer you, or if you want more information, let me know.

Paul
-------------- next part --------------
HTML attachment scrubbed and removed

From turon at ccs.neu.edu  Mon Feb 15 15:26:25 2010
From: turon at ccs.neu.edu (Aaron Turon)
Date: Mon, 15 Feb 2010 15:26:25 -0500
Subject: [PRL] Meeting schedule with Jeff Vaughan
Message-ID: <aac3b4681002151226q476cb706p77a5718cb6432867@mail.gmail.com>

Jeff Vaughan, a post-doc at Harvard, will be visiting on Wed 2/17 and
giving a talk on language support for security (see the PL-seminar
announcement).  He'll be available for meetings in the afternoon, and
would be interested in hearing what both students and faculty are
working on.

If you're interested in meeting with Jeff, please email me your
scheduling constraints for Wednesday and I will make the arrangements.


Aaron


From turon at ccs.neu.edu  Tue Feb 16 10:24:00 2010
From: turon at ccs.neu.edu (Aaron Turon)
Date: Tue, 16 Feb 2010 10:24:00 -0500
Subject: [PRL] =?iso-8859-1?q?scheduling_a_talk_for_Danny_Dub=E9?=
Message-ID: <aac3b4681002160724w52f85773sb5d532444ae6122c@mail.gmail.com>

Danny Dub? would like to give a PL-Seminar style talk, to introduce
himself to the lab, but cannot do so at a standard PL-seminar time.

I'm proposing we hold the talk on Friday at 2:30.  If this doesn't
work for you, please let me know, and tell me what your Friday
afternoon constraints are.

I will send out an official announcement with abstract as soon as the
scheduling is finalized.


From turon at ccs.neu.edu  Tue Feb 16 10:44:46 2010
From: turon at ccs.neu.edu (Aaron Turon)
Date: Tue, 16 Feb 2010 10:44:46 -0500
Subject: [PRL] =?iso-8859-1?q?scheduling_a_talk_for_Danny_Dub=E9?=
In-Reply-To: <aac3b4681002160724w52f85773sb5d532444ae6122c@mail.gmail.com>
References: <aac3b4681002160724w52f85773sb5d532444ae6122c@mail.gmail.com>
Message-ID: <aac3b4681002160744y316b026ey898157978c3e7723@mail.gmail.com>

Friday may be problematic, so also let me know if you would NOT be
able to make a talk Thursday afternoon (for concreteness, let's say
Thursday at noon).  We'll have the talk on the less problematic of
these two days.

Thanks,
Aaron

On Tue, Feb 16, 2010 at 10:24 AM, Aaron Turon <turon at ccs.neu.edu> wrote:
> Danny Dub? would like to give a PL-Seminar style talk, to introduce
> himself to the lab, but cannot do so at a standard PL-seminar time.
>
> I'm proposing we hold the talk on Friday at 2:30. ?If this doesn't
> work for you, please let me know, and tell me what your Friday
> afternoon constraints are.
>
> I will send out an official announcement with abstract as soon as the
> scheduling is finalized.
>


From turon at ccs.neu.edu  Tue Feb 16 10:54:41 2010
From: turon at ccs.neu.edu (Aaron Turon)
Date: Tue, 16 Feb 2010 10:54:41 -0500
Subject: [PRL] =?iso-8859-1?q?scheduling_a_talk_for_Danny_Dub=E9?=
In-Reply-To: <aac3b4681002160744y316b026ey898157978c3e7723@mail.gmail.com>
References: <aac3b4681002160724w52f85773sb5d532444ae6122c@mail.gmail.com> 
	<aac3b4681002160744y316b026ey898157978c3e7723@mail.gmail.com>
Message-ID: <aac3b4681002160754k68575892k6749776a063aa0f7@mail.gmail.com>

Sorry for the spam, but:

Mitch points out Thu noon is the faculty lunch.  This Thursday, PhD
seminar is not holding a talk, so we could do Thursday at 3 instead.

On Tue, Feb 16, 2010 at 10:44 AM, Aaron Turon <turon at ccs.neu.edu> wrote:
> Friday may be problematic, so also let me know if you would NOT be
> able to make a talk Thursday afternoon (for concreteness, let's say
> Thursday at noon). ?We'll have the talk on the less problematic of
> these two days.
>
> Thanks,
> Aaron
>
> On Tue, Feb 16, 2010 at 10:24 AM, Aaron Turon <turon at ccs.neu.edu> wrote:
>> Danny Dub? would like to give a PL-Seminar style talk, to introduce
>> himself to the lab, but cannot do so at a standard PL-seminar time.
>>
>> I'm proposing we hold the talk on Friday at 2:30. ?If this doesn't
>> work for you, please let me know, and tell me what your Friday
>> afternoon constraints are.
>>
>> I will send out an official announcement with abstract as soon as the
>> scheduling is finalized.
>>
>


From wand at ccs.neu.edu  Thu Feb 18 09:09:15 2010
From: wand at ccs.neu.edu (Mitchell Wand)
Date: Thu, 18 Feb 2010 09:09:15 -0500
Subject: [PRL] Fwd: [temp] Seminars Digest, Vol 86, Issue 15
In-Reply-To: <mailman.0.1266501602.20072.seminars@lists.csail.mit.edu>
References: <mailman.0.1266501602.20072.seminars@lists.csail.mit.edu>
Message-ID: <1bd18ad51002180609l650029ai1f13c2940a93be3e@mail.gmail.com>

Several interesting talks in this list...  --Mitch

---------- Forwarded message ----------
From: <seminars-request at lists.csail.mit.edu>
Date: Thu, Feb 18, 2010 at 9:00 AM
Subject: [temp] Seminars Digest, Vol 86, Issue 15
To: seminars at lists.csail.mit.edu


Send Seminars mailing list submissions to
       seminars at lists.csail.mit.edu

To subscribe or unsubscribe via the World Wide Web, visit
       https://lists.csail.mit.edu/mailman/listinfo/seminars
or, via email, send a message with subject or body 'help' to
       seminars-request at lists.csail.mit.edu

You can reach the person managing the list at
       seminars-owner at lists.csail.mit.edu

When replying, please edit your Subject line so it is more specific
than "Re: Contents of Seminars digest..."

Today's Topics:

  1. TALK:Thursday 2-25-10 The Analytical Challenge of Natural
     Algorithms (Csail Event Calendar)
  2. TALK:Thursday 2-18-10 MODERN EXPLOITATION AND MEMORY
     PROTECTION (Csail Event Calendar)
  3. TALK:Thursday 2-25-10 Quantification of colocalization and
     cross-talk        based on spectral angles (Csail Event Calendar)
  4. TALK:Thursday 2-18-10 Snugglebug: A Powerful Approach to
     Weakest   Preconditions (Csail Event Calendar)
  5. TALK:Thursday 2-18-10 7pm Eirik Bakke (Csail Event Calendar)


---------- Forwarded message ----------
From: Csail Event Calendar <eventcalendar at csail.mit.edu>
To: seminars at csail.mit.edu
Date: Thu, 18 Feb 2010 00:01:01 -0500
Subject: TALK:Thursday 2-25-10 The Analytical Challenge of Natural
Algorithms

The Analytical Challenge of Natural Algorithms
Speaker: Bernard Chazelle
Speaker Affiliation: Princeton University
Host: Silvio Micali
Host Affiliation: CSAIL

Date: 2-25-2010
Time: 4:00 PM - 5:30 PM
Refreshments: 3:45 PM
Location: 32-123

Abstract:

What do Boston drivers have in common with migrating geese, flocking cranes,
flashing fireflies, and swarming ants? All of them are acting out a "natural
algorithm." Unlike their software engineered cousins, these algorithms have
been optimized over millions of years through natural selection. They do not
come neatly encoded in readable form, yet scientists have become experts at
modeling them. To call these dynamical systems "algorithms" is to suggest a
new way of studying them, which goes beyond numerical simulations and relies
on analytical tools from theoretical computer science. Can "algorithms
science" do for complex systems what classical math has done for physics? I
cannot answer this question but I can try to convince you why asking it is
not
completely ridiculous.

-----------------------------------------------------

Biography:

Bernard Chazelle is Eugene Higgins Professor of Computer Science at
Princeton
University, where he has been on the faculty since 1986. He has held
research
and faculty positions at Carnegie-Mellon University, Brown University, Ecole
Polytechnique, Ecole Normale Superieure, University of Paris, INRIA, Xerox
Parc, DEC SRC, and NEC Research, where he was a Fellow for many years. He
received his Ph.D in computer science from Yale University in 1980. He is
the
author of the book "The Discrepancy Method."

Honors: Fellow, American Academy of Arts and Sciences;
Member, European Academy of Sciences;
Fellow, World Innovation Foundation;
ACM Fellow;  Guggenheim Fellow.

Relevant URL(S):
For more information please contact: Colleen Russell, 3-0145,
Crussell at csail.mit.edu




---------- Forwarded message ----------
From: Csail Event Calendar <eventcalendar at csail.mit.edu>
To: seminars at csail.mit.edu
Date: Thu, 18 Feb 2010 00:01:01 -0500
Subject: TALK:Thursday 2-18-10 MODERN EXPLOITATION AND MEMORY PROTECTION

MODERN EXPLOITATION AND MEMORY PROTECTION
Speaker: Alexander Sotirov
Host: Vijay Ganesh
Host Affiliation: MIT-CSAIL

Date: 2-18-2010
Time: 3:15 PM - 4:15 PM
Refreshments: 3:00 PM
Location: 32-D463, Star

ABSTRACT
The difficulty of exploiting memory corruption vulnerabilities has increased
significantly with the introduction of the exploitation mitigation features
in
modern operating systems. Stack cookies, non-executable memory and address
space layout randomization successfully prevent most attempts at direct
control flow modification in vulnerable applications. As a result, software
exploitation is much more difficult than it has been at any point in the
past.

This talk will present the challenges facing exploit developers today and
the
latest techniques for defeating the memory protection features in modern
operating systems. It will describe the current state of the art in
exploitation and outline the most promising directions for future
exploitation
research.

BIO
Alexander Sotirov is an independent security researcher with more than ten
years of experience with vulnerability research, reverse engineering and
advanced exploitation. His most recent work includes using chosen prefix MD5
collisions to create a rogue Certificate Authority, bypassing the
exploitation
mitigations on Windows Vista and developing the Heap Feng Shui browser
exploitation technique. His professional experience includes positions as a
security researcher at VMware and Determina. Currently he is working as an
independent security consultant in New York.

He is a regular speaker at applied security conferences around the world,
including CanSecWest, BlackHat and Recon. Alexander served as a program
chair
of the USENIX Workshop on Offensive Technologies and is one of the founders
of
the Pwnie Awards.

Relevant URL(S):
For more information please contact: Mary McDavitt, 617-253-9620,
mmcdavit at csail.mit.edu




---------- Forwarded message ----------
From: Csail Event Calendar <eventcalendar at csail.mit.edu>
To: seminars at csail.mit.edu
Date: Thu, 18 Feb 2010 00:01:01 -0500
Subject: TALK:Thursday 2-25-10 Quantification of colocalization and
cross-talk based on spectral angles

Quantification of colocalization and cross-talk based on spectral angles
Speaker: Carolina Wahlby
Speaker Affiliation: Broad Institute
Host: Polina Golland
Host Affiliation: CSAIL

Date: 2-25-2010
Time: 3:00 PM - 4:00 PM
Location: 32-D507

Highly specific staining methods and fluorescent biological markers
emitting light at different wavelengths together with fluorescence
microscopy allow for detailed studies of the spatial distribution,
localization, and interaction of biomolecules.

Quantification of colocalization of biomolecules includes not only
calculating a global measure of the degree of colocalization within an
image, but also a classification of each image pixel as showing
colocalized signals or not.

Common methods for automated quantification of colocalization require
images where cross-talk has been eliminated by pre-processing, as they are
based on intensity thresholding. Such pre-processing typically requires
manual input.

I will present a novel, automated method for quantification of
colocalization and classification of image pixels based on hue rather than
intensity. The hue distribution is presented as an angle histogram created
by a series of steps that compensate for the quantization noise always
present in digital image data. Classification rules are thereafter based on
the shape of the angle histogram, and detection of colocalized signals is
thus only dependent on hue, making it possible to classify also
low-intensity objects in noisy images, and decouple image segmentation from
detection of colocalization.

Cross-talk will show up as shifts of the peaks of the histogram, and thus a
shift of the classification rules, making the method essentially
insensitive to cross-talk. The method can also be used to quantify and
compensate for crosstalk, independent of the microscope hardware.

Relevant URL(S):
For more information please contact: Polina Golland, x38005,
polina at csail.mit.edu




---------- Forwarded message ----------
From: Csail Event Calendar <eventcalendar at csail.mit.edu>
To: seminars at csail.mit.edu
Date: Thu, 18 Feb 2010 00:01:01 -0500
Subject: TALK:Thursday 2-18-10 Snugglebug: A Powerful Approach to Weakest
Preconditions

Snugglebug: A Powerful Approach to Weakest Preconditions
Speaker: Manu Sridharan
Speaker Affiliation: IBM T.J. Watson Research Center
Host: Daniel Jackson
Host Affiliation: MIT-CSAIL

Date: 2-18-2010
Time: 10:30 AM - 12:00 PM
Location: Patil/Kiva 32-G449

Abstract: Bug-finding tools that are based on approximate analysis often
report false positives. Burned enough by false positives, a skeptical
programmer wants to see convincing evidence that a bug report is indeed
feasible. Symbolic analysis can often help produce such evidence in the form
of a concrete test case that can reproduce a feasible bug. In this talk, I
will describe recent work my colleagues and I have done on symbolic analysis
of Java programs. In much of the talk, I will focus on the technology needed
to make symbolic analysis work effectively on real-world Java applications,
without requiring hand-written specifications of procedures, and without
inlining procedure calls away. I will report on our experience with building
a
bug report validator based on symbolic analysis, and discuss some open
research questions.

Bio: Manu Sridharan has been a research staff member at IBM T.J. Watson
Research Center since 2008. He received his PhD from the University of
California, Berkeley in 2007, and his dissertation work focused on
refinement-based program analysis tools. He has done research on a variety
of
topics in static analysis, dynamic analysis, and software engineering. His
current projects include work on symbolic analysis, security, and
refactoring
for multicores.

Relevant URL(S):
For more information please contact: Maria Rebelo, 3-5895, mr at csail.mit.edu




---------- Forwarded message ----------
From: Csail Event Calendar <eventcalendar at csail.mit.edu>
To: seminars at csail.mit.edu
Date: Thu, 18 Feb 2010 00:01:01 -0500
Subject: TALK:Thursday 2-18-10 7pm Eirik Bakke

Boston IEEE/ACM Joint Seminar Series 2009/2010
A Common Class of Business-Oriented Database Applications or: How I Hope to
Achieve what Microsoft Access Didn
Speaker: Eirik Bakke
Speaker Affiliation: M.I.T. CSAIL and EECS
Host: Peter Mager
Host Affiliation: p.mager AT computer.org

Date: 2-18-2010
Time: 7:00 PM - 9:00 PM
Location: E51-315

If you've ever used a piece of highly domain-specific business software,
chances are it was nothing but a graphical front-end to some database.
However, while such systems can be extremely useful to the organizations
they
are tailored for, they take a very long time to develop relative to their
number of potential target users. Even with tools like FileMaker, 4D, or
Microsoft Access, developers must spend time on low-level tasks such as form
design, data binding, and hard-coding of common design patterns. Whereas
off-the-shelf SQL databases have sufficed as application back-ends for
decades, no similar universal component exists to provide the front-end and
middle tier.

In this talk I'll present my ideas for eliminating most of the work involved
in developing customized database applications, and show you some of my
current progress, including: a query language that formalizes database GUIs,
a
simple automatic layout generator, and a spreadsheet that understands
relationships.

Before fleeing to the US, Eirik evaded military service by spending a year
as
an end-user of an amazingly obscure (and aquatically themed) database system
made specifically for the administration of public Norwegian schools of
music,
theatre, and visual arts. Now safe in the hands of his advisors Prof. David
Karger and Prof. Rob Miller, Eirik is at MIT CSAIL working towards his
Master's Degree and, eventually/hopefully, his PhD.

This joint meeting of the Boston Chapter of the IEEE Computer Society and
GBC/ACM will be held in MIT Room E51-315.  E51 is the Tang Center on the
corner of Wadsworth and Amherst Sts and Memorial Dr.; it's mostly used by
the
Sloan School. You can see it on this map of the MIT campus. Room 315 is on
the
3rd floor.

Up-to-date information about this and other talks is available online at
http://ewh.ieee.org/r1/boston/computer/ (also accessible via the alias
http://TinyURL/BostonComputer/). You can sign up to receive updated status
information about this talk and informational emails about future talks at
http://mailman.mit.edu/mailman/listinfo/ieee-cs, our self-administered
mailing
list.

Relevant URL(S): http://ewh.ieee.org/r1/boston/computer/eiriktalk.html
For more information please contact: Dorothy Curtis, 617-253-0541,
dcurtis at csail.mit.edu



_______________________________________________
Seminars mailing list
Seminars at lists.csail.mit.edu
https://lists.csail.mit.edu/mailman/listinfo/seminars
-------------- next part --------------
HTML attachment scrubbed and removed

From dvanhorn at ccs.neu.edu  Thu Mar  4 20:10:05 2010
From: dvanhorn at ccs.neu.edu (David Van Horn)
Date: Thu, 04 Mar 2010 20:10:05 -0500
Subject: [PRL] Fwd: Positions - FP AD PhD or Postdoc
Message-ID: <4B9059ED.4010602@ccs.neu.edu>


----- Forwarded Message -----
From: "Barak A. Pearlmutter" <barak at cs.nuim.ie>
To: "David Van Horn" <dvanhorn at brandeis.edu>
Sent: Tuesday, March 2, 2010 6:02:15 AM GMT -05:00 US/Canada Eastern
Subject: Positions - FP AD PhD or Postdoc

This below flier is a continuation of the AD stuff we chatted about
what seems so long ago.  There is a lot of room for type theory, so I
thought you might know someone appropriate who'd be into it.


I'm looking for PhD students and postdocs interested in working on an
elegant combination of functional programming and big-iron style
numeric computing.  Blurb below.  If you know anyone good who might be
interested, I'd be grateful if you'd pass this along.

					Cheers,

					--Barak.

----------------------------------------------------------------

From: "Barak A. Pearlmutter" <barak at cs.nuim.ie>
Subject: Positions - FP AD PhD or Postdoc
Date: Tue, 02 Mar 2010 10:14:35 +0000
Reply-To: "Barak A. Pearlmutter" <barak+ad-fp-job at cs.nuim.ie>

	 Functional Programming and Automatic Differentiation

			   PhD Studentships
			Postdoctoral Positions

We are adding exact first-class derivative calculation operators
(Automatic Differentiation or AD) to the lambda calculus, and
embodying the combination into a production-quality optimising
compiler.  Our research prototype compiler generates object code
competitive with the fastest current systems, which are based on
FORTRAN.  We are seeking PhD students and postdocs with interest and
experience in relevant areas: programming language theory, numeric
computing/numeric linear algebra, or differential geometry; and a
burning drive to help lift big iron numeric computing out of the 1960s
and into a newer higher order.  Specific sub-projects include:
compiler and numeric programming environment construction; writing,
simplifying, and generalising numeric algorithms through the use of AD
operators; and associated type/lambda calculus/PLT/real computation
issues.

The project headquarters will be in the Hamilton Institute, NUI
Maynooth, Ireland, http://www.hamilton.ie/.

Applications to:
   "Barak A. Pearlmutter" <barak+ad-fp-job at cs.nuim.ie>


From chadwick at ccs.neu.edu  Sun Mar  7 14:22:38 2010
From: chadwick at ccs.neu.edu (Bryan Chadwick)
Date: Sun, 07 Mar 2010 14:22:38 -0500
Subject: [PRL] Practice Talk for AOSD
Message-ID: <4B93FCFE.8020709@ccs.neu.edu>

Hello all,

I'll be doing a practice talk for my AOSD presentation tomorrow (Monday) @ 2:30 in WVH 166.

If you can make it and provide feedback I would appreciate it.  The paper title and abstract are below.

Thanks,
Bryan.

--------------------------------


Title: Weaving Generic Programming and Traversal Performance
Authors: Bryan Chadwick and Karl Lieberherr

Abstract:
   Developing complex software requires that functions be implemented
   over a variety of recursively defined data structures.  While the
   design (and modeling) of structures is itself difficult, complex
   data can require even more complex functions.  In this paper, we
   introduce a declarative form of traversal-based generic
   programming that modularizes functions over a structure using
   function-objects. Our approach is supported by a library and set
   of generative tools, collectively called DemeterF, which are used
   to implement modular, adaptive functions. While our traversals
   support high-level abstractions resulting in modular and
   extensible functions, we retain genericity, flexibility and
   performance through traversal generation and inlining.


From tov at ccs.neu.edu  Mon Mar  8 18:27:26 2010
From: tov at ccs.neu.edu (Jesse A. Tov)
Date: Mon, 8 Mar 2010 18:27:26 -0500
Subject: [PRL] Torture Chamber: Wednesday, 1:30 PM, WVH 166
Message-ID: <1461f5881003081527s2f1f26cbhed819fbf086c3498@mail.gmail.com>

I will be holding a torture chamber for my ESOP talk at 1:30 PM this
Wednesday in WVH 166.  The title of the talk is "Stateful Contracts
for Affine Types".  Here's the abstract:

Affine type systems manage resources by preventing some values from
being used more than once. This offers expressiveness and performance
benefits, but difficulty arises in interacting with components written
in a conventional language whose type system provides no way to
maintain the affine type system's aliasing invariants. We propose and
implement a technique that uses behavioral contracts to mediate
between code written in an affine language and code in a conventional
typed language. We formalize our approach via a typed calculus with
both affine-typed and conventionally-typed modules. We show how to
preserve the guarantees of both type systems despite both languages
being able to call into each other and exchange higher-order values.

If you can make it, I would definitely appreciate your feedback.

Thanks,
Jesse


From wand at ccs.neu.edu  Mon Mar  8 21:09:16 2010
From: wand at ccs.neu.edu (Mitchell Wand)
Date: Mon, 8 Mar 2010 21:09:16 -0500
Subject: [PRL] InformIT: An Interview with Watts Humphrey,
	Part 3: Sylvania and 	Northeastern University >
Message-ID: <1bd18ad51003081809j77afadd1r28b487505f3a2fcb@mail.gmail.com>

Did you know that Watts Humphrey *taught* computers at NU in 1954?  And that
the Sylvania lab he was working for  was on campus?

Link: http://www.informit.com/articles/article.aspx?p=1568183 (via
shareaholic.com)
-------------- next part --------------
HTML attachment scrubbed and removed

From lieber at ccs.neu.edu  Fri Mar 12 21:24:18 2010
From: lieber at ccs.neu.edu (Karl Lieberherr)
Date: Fri, 12 Mar 2010 21:24:18 -0500
Subject: [PRL] best AOSD 2010 paper
In-Reply-To: <9eb963931003052005q7ff481ccof00b9f8e5d4b5f33@mail.gmail.com>
References: <9eb963931003052005q7ff481ccof00b9f8e5d4b5f33@mail.gmail.com>
Message-ID: <9eb963931003121824y254cf41boae14ad2d135e1dcb@mail.gmail.com>

The enclosed paper won the AOSD 2010 best paper award. It heavily uses PRL
members and friends work: Shriram (AspectScheme), Matthias (PLT Redex) and
Mitch (AspectJ semantics and reflective towers of interpreters).

-- Karl
-------------- next part --------------
HTML attachment scrubbed and removed
-------------- next part --------------
A non-text attachment was scrubbed...
Name: tanter.pdf
Type: application/pdf
Size: 356399 bytes
Desc: not available
Url : http://lists.ccs.neu.edu/pipermail/prl/attachments/20100312/bc52aaa9/attachment-0001.pdf 

From lieber at ccs.neu.edu  Sun Mar 14 09:34:00 2010
From: lieber at ccs.neu.edu (Karl Lieberherr)
Date: Sun, 14 Mar 2010 08:34:00 -0500
Subject: [PRL] Fwd: Adaptive Object-Oriented Programming at WGP 2010?
In-Reply-To: <731CCA79-78FF-4828-A1B9-861BEFF685B3@ropas.snu.ac.kr>
References: <731CCA79-78FF-4828-A1B9-861BEFF685B3@ropas.snu.ac.kr>
Message-ID: <9eb963931003140634t3dc479f7i1b7242938668061f@mail.gmail.com>

Please consider submitting a paper to the generic programming workshop.
Several of you will be at ICFP anyway.

-- Karl
---------- Forwarded message ----------
From: Bruno Oliveira <bruno at ropas.snu.ac.kr>
Date: Sat, Mar 13, 2010 at 11:17 PM
Subject: Adaptive Object-Oriented Programming at WGP 2010?
To: Karl Lieberherr <lieber at ccs.neu.edu>, Bryan Chadwick <
chadwick at ccs.neu.edu>


Dear Karl and Brian,

I am one of the co-chairs of WGP 2010 this year. As you may (or may not)
know,
AOOP is on-topic for the workshop. I think the WGP community would be very
interested to hear about the latest progress on AOOP. So I am writing for
you to
consider submitting a paper (or more than one) to WGP this year. I would
also
like to ask if you could pass the call for papers to other members of your
group
or other people with interest on AOOP. The actual call for papers for WGP
is
shown next:

======================================================================
                           CALL FOR PAPERS

                               WGP 2010

           6th ACM SIGPLAN Workshop on Generic Programming
                       Baltimore, Maryland, US
                     Sunday, September 26th, 2010


http://osl.iu.edu/wgp2010<http://www.google.com/url?sa=D&q=http://osl.iu.edu/wgp2010&usg=AFQjCNEqvgk48zk8yYdSQVb6yBk77IeVxg>

Collocated with the International Conference on Functional Programming
                             (ICFP 2010)
======================================================================

Goals of the workshop
---------------------

Generic programming is about making programs more adaptable by making
them more general. Generic programs often embody non-traditional kinds
of polymorphism; ordinary programs are obtained from them by suitably
instantiating their parameters. In contrast with normal programs, the
parameters of a generic program are often quite rich in structure; for
example they may be other programs, types or type constructors, class
hierarchies, or even programming paradigms.

Generic programming techniques have always been of interest, both to
practitioners and to theoreticians, and, for at least 20 years,
generic programming techniques have been a specific focus of research
in the functional and object-oriented programming communities. Generic
programming has gradually spread to more and more mainstream
languages, and today is widely used in industry. This workshop brings
together leading researchers and practitioners in generic programming
from around the world, and features papers capturing the state of the
art in this important area.

We welcome contributions on all aspects, theoretical as well as
practical, of

     * polytypic programming,
     * programming with dependent types,
     * programming with type classes,
     * programming with (C++) concepts,
     * generic programming,
     * programming with modules,
     * meta-programming,
     * adaptive object-oriented programming,
     * component-based programming,
     * strategic programming,
     * aspect-oriented programming,
     * family polymorphism,
     * object-oriented generic programming,
     * and so on.

Organizers
----------

Co-Chair
   Bruno C. d. S. Oliveira, Seoul National University
Co-Chair
   Marcin Zalewski, Indiana University

Programme Committee
-------------------

Alley Stoughton, Kansas State University
Andrei Alexandrescu, Facebook
Bruno C. d. S. Oliveira (Co-Chair), Seoul National University
Doug Gregor, Apple
Gilad Bracha, I am a Computational Theologist Emeritus
Magne Haveraaen, Universitetet i Bergen
Marcin Zalewski (Co-Chair), Indiana University
Neil Mitchell, Standard Chartered
Ralf L?mmel, University of Koblenz-Landau
Shin-Cheng Mu, Academia Sinica
Thorsten Altenkirch, University of Nottingham
Ulf Norell, Chalmers University

Important Information
---------------------

We plan to have formal proceedings, published by the ACM.

Submission details
Deadline for submission:     Sunday    2010-06-13
Notification of acceptance:  Monday    2010-07-12
Final submission due:          Tuesday   2010-07-27
Workshop:                            Sunday    2010-09-26

Authors should submit papers, in postscript or PDF format, formatted
for A4 paper, to the WGP09 EasyChair instance by 13th of June
2010. The length should be restricted to 12 pages in standard
(two-column, 9pt) ACM format. Accepted papers are published by the ACM
and will additionally appear in the ACM digital library.

History of the Workshop on Generic Programming
----------------------------------------------

This year:

   * Baltimore, Maryland, US 2010 (affiliated with ICFP10)

Earlier Workshops on Generic Programming have been held in

   * Edinburgh, UK 2009 (affiliated with ICFP09)
   * Victoria, BC, Canada 2008 (affiliated with ICFP),
   * Portland 2006 (affiliated with ICFP),
   * Ponte de Lima 2000 (affiliated with MPC),
   * Marstrand 1998 (affiliated with MPC).

Furthermore, there were a few informal workshops

   * Utrecht 2005 (informal workshop),
   * Dagstuhl 2002 (IFIP WG2.1 Working Conference),
   * Nottingham 2001 (informal workshop),

There were also (closely related) DGP workshops in Oxford (June
3-4 2004), and a Spring School on DGP in Nottingham (April 24-27
2006, which had a half-day workshop attached).
Additional information:
The WGP steering committee consists of J Gibbons, R Hinze, P Jansson,
J Jarvi, J Jeuring, B Oliveira, S Schupp and M Zalewski
-------------- next part --------------
HTML attachment scrubbed and removed

From dimvar at ccs.neu.edu  Tue Mar 16 14:30:50 2010
From: dimvar at ccs.neu.edu (Dimitris Vardoulakis)
Date: Tue, 16 Mar 2010 14:30:50 -0400
Subject: [PRL] ESOP practice talk
Message-ID: <52b08d01003161130y351b6698q5c1555e9ece26692@mail.gmail.com>

Hi all,

I'm going to give a torture-chamber talk for my ESOP paper titled
"CFA2: a Context-Free Approach to Control-Flow Analysis" on Thursday,
March 18 at 1.30 pm in WVH 164. If you can come and give feedback I'd
greatly appreciate it.


Abstract:

In a functional language, the dominant control-flow mechanism is
function call and return. Most higher-order flow analyses, including k
-CFA, do not handle call and return well: they remember only a bounded
number of pending calls because they approximate programs with
control-flow graphs. Call/return mismatch introduces
precision-degrading spurious control-flow paths and increases the
analysis time.

We describe CFA2, the first flow analysis with precise call/return
matching in the presence of higher-order functions and tail calls. We
formulate CFA2 as an abstract interpretation of programs in
continuation-passing style and describe a sound and complete
summarization algorithm for our abstract semantics. A preliminary
evaluation shows that CFA2 gives
more accurate data-flow information than 0CFA and 1CFA.


-- 
Dimitris


From matthias at ccs.neu.edu  Thu Mar 18 08:50:00 2010
From: matthias at ccs.neu.edu (Matthias Felleisen)
Date: Thu, 18 Mar 2010 08:50:00 -0400
Subject: [PRL] Kathleen
Message-ID: <4996EA08-96FF-47F4-AA9A-B48D2DC7D2F7@ccs.neu.edu>


Everyone, Kathleen Fisher (AT&T Labs, http://www.research.att.com/people/Fisher_Kathleen_S ) will visit us on April 5. If you are interested in meeting with her between 3:30 and 5:30 let me know as soon as possible. Thanks -- Matthias




From matthias at ccs.neu.edu  Fri Mar 19 09:20:27 2010
From: matthias at ccs.neu.edu (Matthias Felleisen)
Date: Fri, 19 Mar 2010 09:20:27 -0400
Subject: [PRL] Fwd: CFPapers: 22nd Symposium on Implementation and
	Applications of Functional Languages (IFL 2010)
References: <6F8717F9-52D9-401B-ACEF-B4D4FF8D0E0B@cs.uu.nl>
Message-ID: <40B04DF9-3F54-4676-85E0-49CD9121DB6E@ccs.neu.edu>



Begin forwarded message:

> From: jur <jur at CS.UU.NL>
> Date: March 19, 2010 9:05:11 AM EDT
> To: EAPLS at JISCMAIL.AC.UK
> Subject: CFPapers: 22nd Symposium on Implementation and Applications  
> of Functional Languages (IFL 2010)
> Reply-To: jur <jur at CS.UU.NL>
>
> CALL FOR PAPERS
>
> 22nd Symposium on Implementation and Applications of Functional  
> Languages (IFL 2010)
> September 1-3, 2010
> Utrecht University
> Alphen aan den Rijn, The Netherlands
> http://www.cs.uu.nl/wiki/bin/view/IFL2010/WebHome
>
>
> After a first successful visit to the USA, the Symposium on  
> Implementation and Applications of Functional
> Languages returns to Europe for its 22nd edition. The hosting  
> institution is Utrecht University in the
> Netherlands, although the conference itself will take place in the  
> ornithological theme park Avifauna
> in Alphen aan den Rijn, situated conveniently close to Schiphol  
> (Amsterdam Airport). The symposium dates
> are September 1-3, 2010.
>
> The goal of the IFL symposia is to bring together researchers  
> actively engaged in the implementation and
> application of functional and function-based programming languages.  
> IFL 2010 will be a venue for researchers
> to present and discuss new ideas and concepts, work in progress, and  
> publication-ripe results related to
> the implementation and application of functional languages and  
> function-based programming.
>
> Following the IFL tradition, IFL 2010 will use a post-symposium  
> review process to produce formal proceedings
> which will be published by Springer Verlag in the Lecture Notes in  
> Computer Science series. All participants in
> IFL 2010 are invited to submit either a draft paper or an extended  
> abstract describing work to be presented
> at the symposium. At no time may work submitted to IFL be  
> simultaneously submitted to other venues. Here
> we follow the ACM Sigplan republication policy as defined on http://www.sigplan.org/republicationpolicy.htm 
> .
> The submissions will be screened by the program committee chair to  
> make sure they are within the scope of IFL,
> and will appear in the draft proceedings distributed at the  
> symposium. Submissions appearing in the draft
> proceedings are not peer-reviewed publications. After the symposium,  
> authors will be given the opportunity
> to incorporate the feedback from discussions at the symposium and  
> will be invited to submit a revised full
> article for the formal review process. These revised submissions  
> will be reviewed by the program committee
> using prevailing academic standards to select the best articles,  
> which will appear in the formal proceedings.
>
> INVITED SPEAKER
>
> Johan Nordlander of Lulea University, the designer and developer of  
> the Timber language, is the invited
> speaker at IFL 2010. Timber is a functional programming language  
> that draws some of its concepts from
> object-oriented programming, and has built-in facilities for  
> concurrent execution. The language is
> specifically targeted at implementing real-time embedded systems.
>
> TOPICS
>
> IFL welcomes submissions describing practical and theoretical work  
> as well as submissions describing
> applications and tools. If you are not sure that your work is  
> appropriate for IFL 2010, please contact
> the PC chair at jur at cs.uu.nl. Topics of interest include, but are  
> not limited to:
>
> language concepts
> type checking
> contracts
> compilation techniques
> staged compilation
> runtime function specialization
> runtime code generation
> partial evaluation
> (abstract) interpretation
> generic programming techniques
> automatic program generation
> array processing
> concurrent/parallel programming
> concurrent/parallel program execution
> functional programming and embedded systems
> functional programming and web applications
> functional programming and security
> novel memory management techniques
> runtime profiling and performance measurements
> debugging and tracing
> virtual/abstract machine architectures
> validation and verification of functional programs
> tools and programming techniques
> industrial applications of functional programming
>
> PAPER SUBMISSIONS
>
> Prospective authors are encouraged to submit papers or extended  
> abstracts to be published in the draft proceedings
> and to present them at the symposium. All contributions must be  
> written in English, conform to the Springer-Verlag
> LNCS series format and not exceed 16 pages. The draft proceedings  
> will appear as a technical report of the
> Department of Computer Science of Utrecht University.
>
> PETER LANDIN PRIZE
>
> The Peter Landin Prize is awarded to the best paper presented at the  
> symposium every year.
> The honored article is selected by the program committee based on  
> the submissions received for
> the formal review process. The prize carries a cash award equivalent  
> to 150 Euros.
>
> IMPORTANT DATES
>
> Draft proceedings submission deadline   July 25, 2010
> Registration deadline                   August 1, 2010
> IFL 2010 Symposium                      September 1-3, 2010
> Submission for review process deadline  October 25, 2010
> Notification Accept/Reject              December 22, 2010
> Camera ready version                    February 17, 2011
>
>
> PROGRAM COMMITTEE
>
> Jost Berthold 	 	University of Copenhagen (DIKU), Denmark
> Olaf Chitil 		University of Kent, UK
> John Clements 		California Polytechnic State University, USA
> Matthew Fluet 		Rochester Institute of Technology, USA
> Andy Gill 		Kansas University, USA
> Jurriaan Hage (Chair)	University of Utrecht, Netherlands
> Bastiaan Heeren 	Open University, Netherlands
> Ralf Hinze 		University of Oxford, UK
> John Hughes 		Chalmers University of Technology, Sweden
> Yukiyoshi Kameyama 	University of Tsukuba, Japan
> Gabriele Keller 	University of New South Wales, Australia
> Pieter Koopman 		Radboud University Nijmegen, Netherlands
> Luc Maranget 		INRIA, France
> Simon Marlow 		Microsoft Research, UK
> Marco T. Morazan 	Seton Hall University, USA
> Rex Page 		University of Oklahoma, USA
> Ricardo Pena 		Universidad Complutense de Madrid, Spain
> Sven-Bodo Scholz 	University of Hertfordshire, UK
> Tom Schrijvers 		Catholic University of Leuven, Belgium
> Don Stewart 		Galois, USA
> Wouter Swierstra 	Vector Fabrics, Netherlands
> Don Syme 		Microsoft, UK
> Peter Thiemann 		University of Freiburg, Germany
> Phil Trinder 		Heriott-Watt University, Scotland
> Janis Voigtlaender 	University of Bonn, Germany
> Viktoria Zsok 		Eotvos Lorand University, Hungary



From dvanhorn at ccs.neu.edu  Fri Mar 19 10:12:39 2010
From: dvanhorn at ccs.neu.edu (David Van Horn)
Date: Fri, 19 Mar 2010 10:12:39 -0400
Subject: [PRL] Fwd: [NJ-pls] Call for talks for the next NJPLS (April 9 at
	Stevens)
Message-ID: <4BA38657.8080204@ccs.neu.edu>



-------- Original Message --------
Subject: [NJ-pls] Call for talks for the next NJPLS (April 9 at Stevens)
Date: Fri, 19 Mar 2010 09:54:02 -0400 (EDT)
From: David Naumann <naumann at cs.stevens.edu>
To: nj-pls at lists.seas.upenn.edu

Dear all,

The next NJPLS will be on Friday April 9 at Stevens Institute of Technology.
A number of interesting talks have been proposed but there is still room
for a couple more.

If you would like to present a cool idea to the NJPLS community, please
send me your talk request by March 24.  Please send me an email with your
talk title and abstract. All topics in programming languages and systems
are welcome.

Stevens is located in Hoboken, just across the Hudson river from midtown
Manhattan.

Information about past NJPLS events can be found at http://www.njpls.org/

Regards,
Dave Naumann

---------------------------------------------------------------
David A. Naumann                   naumann at cs.stevens.edu
Professor of Computer Science      www.cs.stevens.edu/~naumann/
Stevens Institute of Technology    Office: 305 Lieb Building
Castle Point on Hudson             Tel: 201-216-5608
Hoboken, NJ 07030 USA              Fax: 201-216-8249
---------------------------------------------------------------
_______________________________________________
NJ-pls mailing list
NJ-pls at lists.seas.upenn.edu
http://lists.seas.upenn.edu/mailman/listinfo/nj-pls


From matthias at ccs.neu.edu  Fri Mar 19 11:40:40 2010
From: matthias at ccs.neu.edu (Matthias Felleisen)
Date: Fri, 19 Mar 2010 11:40:40 -0400
Subject: [PRL] open house
Message-ID: <E5DA935F-8AB4-4DF8-BA83-AE691007085E@ccs.neu.edu>


Everyone, Olin and Pete are speaking to the visiting students in the  
session following lunch. Please attend the session if possible --  
Matthias


http://www.ccs.neu.edu/graduate/phd_open_house.html


From matthias at ccs.neu.edu  Mon Mar 22 10:05:27 2010
From: matthias at ccs.neu.edu (Matthias Felleisen)
Date: Mon, 22 Mar 2010 10:05:27 -0400
Subject: [PRL] Fwd: [TYPES] Very sad news
References: <d2a0b74b1003220651v76226335ib65818419c2e0a4b@mail.gmail.com>
Message-ID: <8CFF8438-81D4-4984-AB39-3AC5F73813B8@ccs.neu.edu>



Begin forwarded message:

> From: Gordon Plotkin <gdp at inf.ed.ac.uk>
> Date: March 22, 2010 9:51:22 AM EDT
> To: types-list at lists.seas.upenn.edu, Gordon Plotkin <gdp at inf.ed.ac.uk>
> Subject: [TYPES] Very sad news
>
> [ The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list 
>  ]
>
> Dear Colleagues,
>
> I am deeply saddened to pass on the following message from Barney  
> and Chlo?
> Milner:
>
> "We are sorry to announce that Robin Milner died on Saturday 20th  
> March, in
> Cambridge, just three days after the funeral of his wife, Lucy.
>
> He will be greatly missed by his family and friends, as well as the  
> academic
> community."
>
>
> Gordon Plotkin



From pete at ccs.neu.edu  Tue Mar 30 15:13:11 2010
From: pete at ccs.neu.edu (Pete Manolios)
Date: Tue, 30 Mar 2010 15:13:11 -0400
Subject: [PRL] Karl V. Karlstom Outstanding Educator Award goes to Matthias
Message-ID: <2f1dfad71003301213j48e80214r2854305e2ad2848e@mail.gmail.com>

Congratulations to Matthias!

Today ACM announced the winners of six prestigious awards for their
innovations in computing technology that demonstrate the benefits of
computational thinking for industry, education, and society.

The winners are:

...
Matthias Felleisen, the Karl V. Karlstom Outstanding Educator Award,
for his visionary and long-standing contributions to K-12 outreach
programs.
...

-- 
Pete Manolios
Northeastern University
http://www.ccs.neu.edu/home/pete


From cce at ccs.neu.edu  Tue Mar 30 16:36:27 2010
From: cce at ccs.neu.edu (Carl Eastlund)
Date: Tue, 30 Mar 2010 16:36:27 -0400
Subject: [PRL] Karl V. Karlstom Outstanding Educator Award goes to
	Matthias
In-Reply-To: <2f1dfad71003301213j48e80214r2854305e2ad2848e@mail.gmail.com>
References: <2f1dfad71003301213j48e80214r2854305e2ad2848e@mail.gmail.com>
Message-ID: <990e0c031003301336s2f3c8e00y69b415b0bd44812@mail.gmail.com>

Congratulations, Matthias.  Celebrate by buying yourself a big new monitor!

Carl Eastlund

On Tue, Mar 30, 2010 at 3:13 PM, Pete Manolios <pete at ccs.neu.edu> wrote:
> Congratulations to Matthias!
>
> Today ACM announced the winners of six prestigious awards for their
> innovations in computing technology that demonstrate the benefits of
> computational thinking for industry, education, and society.
>
> The winners are:
>
> ...
> Matthias Felleisen, the Karl V. Karlstom Outstanding Educator Award,
> for his visionary and long-standing contributions to K-12 outreach
> programs.
> ...
>
> --
> Pete Manolios
> Northeastern University
> http://www.ccs.neu.edu/home/pete


From dherman at ccs.neu.edu  Wed Mar 31 19:38:43 2010
From: dherman at ccs.neu.edu (David Herman)
Date: Wed, 31 Mar 2010 16:38:43 -0700
Subject: [PRL] a plea for graduation tix
Message-ID: <CE7DD165-1DFD-4EE6-80D1-A29015DBB421@ccs.neu.edu>

I would like to send out a general plea to anyone who might take mercy on me and help me get past the 4-ticket limit for graduation. I am trying to focus on the dissertation but I have all kinds of family who want to make travel plans. I'm told there are ways to get extra tickets but I am pretty confident you have to be in town to make any headway. Would someone be so kind as to help me in my predicament?

At this point, I am looking at some ungodly number of family members... somewhere between 8 - 10 adults plus 2 little kids.

Help?

Thanks,
Dave