<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>dvanhorn @ λ-calcul.us &#187; Jobs</title>
	<atom:link href="http://dvanhorn.lambda-calcul.us/category/jobs/feed/" rel="self" type="application/rss+xml" />
	<link>http://dvanhorn.lambda-calcul.us</link>
	<description>Research weblog for David Van Horn</description>
	<lastBuildDate>Sat, 28 Aug 2010 13:39:54 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>PhD and Postdoc positions: Functional Programming and Automatic Differentiation</title>
		<link>http://dvanhorn.lambda-calcul.us/2010/03/04/phd-and-postdoc-positions-functional-programming-and-automatic-differentiation/</link>
		<comments>http://dvanhorn.lambda-calcul.us/2010/03/04/phd-and-postdoc-positions-functional-programming-and-automatic-differentiation/#comments</comments>
		<pubDate>Fri, 05 Mar 2010 01:14:51 +0000</pubDate>
		<dc:creator>dvanhorn</dc:creator>
				<category><![CDATA[Jobs]]></category>

		<guid isPermaLink="false">http://dvanhorn.lambda-calcul.us/?p=219</guid>
		<description><![CDATA[Barak Pearlmutter is looking for PhD students and postdocs to work on functional programming and automatic differentiation.

I&#8217;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&#8217;d be grateful if you&#8217;d pass this [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.bcl.hamilton.ie/~barak/">Barak Pearlmutter</a> is looking for PhD students and postdocs to work on functional programming and automatic differentiation.</p>
<blockquote><p>
I&#8217;m looking for PhD students and postdocs interested in working on an<br />
elegant combination of functional programming and big-iron style<br />
numeric computing.  Blurb below.  If you know anyone good who might be<br />
interested, I&#8217;d be grateful if you&#8217;d pass this along.
</p></blockquote>
<p>Sounds fun!</p>
<blockquote><p>
	 Functional Programming and Automatic Differentiation</p>
<p>			   PhD Studentships<br />
			Postdoctoral Positions</p>
<p>We are adding exact first-class derivative calculation operators<br />
(Automatic Differentiation or AD) to the lambda calculus, and<br />
embodying the combination into a production-quality optimising<br />
compiler.  Our research prototype compiler generates object code<br />
competitive with the fastest current systems, which are based on<br />
FORTRAN.  We are seeking PhD students and postdocs with interest and<br />
experience in relevant areas: programming language theory, numeric<br />
computing/numeric linear algebra, or differential geometry; and a<br />
burning drive to help lift big iron numeric computing out of the 1960s<br />
and into a newer higher order.  Specific sub-projects include:<br />
compiler and numeric programming environment construction; writing,<br />
simplifying, and generalising numeric algorithms through the use of AD<br />
operators; and associated type/lambda calculus/PLT/real computation<br />
issues.</p>
<p>The project headquarters will be in the Hamilton Institute, NUI<br />
Maynooth, Ireland, http://www.hamilton.ie/.</p>
<p>Applications to:<br />
  &#8220;Barak A. Pearlmutter&#8221; <barak+ad-fp-job@cs.nuim.ie>
</p></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://dvanhorn.lambda-calcul.us/2010/03/04/phd-and-postdoc-positions-functional-programming-and-automatic-differentiation/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Jane Street Summer Project, 2009</title>
		<link>http://dvanhorn.lambda-calcul.us/2009/02/02/jane-street-summer-project-2009/</link>
		<comments>http://dvanhorn.lambda-calcul.us/2009/02/02/jane-street-summer-project-2009/#comments</comments>
		<pubDate>Mon, 02 Feb 2009 17:16:46 +0000</pubDate>
		<dc:creator>dvanhorn</dc:creator>
				<category><![CDATA[Jobs]]></category>

		<guid isPermaLink="false">http://dvanhorn.lambda-calcul.us/?p=74</guid>
		<description><![CDATA[Jane Street Capital has announced their 2009 summer project:
I&#8217;m pleased to announce the Jane Street Summer Project for 2009.  The goal
of the JSSP is to make functional programming languages into better
practical tools for programming in the real world.  To do that, we will
fund students over the summer to work on open-source projects which aim at
improving [...]]]></description>
			<content:encoded><![CDATA[<p>Jane Street Capital has announced their 2009 summer project:</p>
<blockquote><p>I&#8217;m pleased to announce the Jane Street Summer Project for 2009.  The goal<br />
of the JSSP is to make functional programming languages into better<br />
practical tools for programming in the real world.  To do that, we will<br />
fund students over the summer to work on open-source projects which aim at<br />
improving the practical utility of their favorite functional language.</p>
<p>The JSSP is a follow-on to last year&#8217;s OCaml Summer Project.  A key<br />
difference this year is that we are opening up the project to proposals in<br />
languages other than OCaml (although we expect to maintain a focus on OCaml<br />
projects.)  There are also some changes to the funding structure that are<br />
particularly relevant for projects located in the US.</p>
<p>If you want to find out more, you can look at the JSSP blog:</p>
<p><a href="http://janestreetsummer.com">http://janestreetsummer.com</a></p>
<p>And at the project FAQ:</p>
<p><a href="http://ocaml.janestreet.com/?q=node/57">http://ocaml.janestreet.com/?q=node/57</a></p>
<p>We&#8217;re looking forward to a great and productive summer, and we hope some of<br />
you come along for the ride!</p>
<p>Thanks,<br />
Yaron Minsky</p></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://dvanhorn.lambda-calcul.us/2009/02/02/jane-street-summer-project-2009/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Positions in Formal Methods at Northeastern</title>
		<link>http://dvanhorn.lambda-calcul.us/2009/01/24/positions-in-formal-methods-at-northeastern/</link>
		<comments>http://dvanhorn.lambda-calcul.us/2009/01/24/positions-in-formal-methods-at-northeastern/#comments</comments>
		<pubDate>Sat, 24 Jan 2009 16:22:07 +0000</pubDate>
		<dc:creator>dvanhorn</dc:creator>
				<category><![CDATA[Jobs]]></category>

		<guid isPermaLink="false">http://dvanhorn.lambda-calcul.us/?p=57</guid>
		<description><![CDATA[These are excellent opportunities to work on formal methods with Pete Manolios at Northeastern.  There are two positions open: research scientist and postdoc.  Announcements for both are included below.  First, the research scientist position:
Research scientist position in Formal Methods
Prof. Pete Manolios
Northeastern University
Boston, Massachusetts
Highly motivated applicants are being sought to work on the
automation of component-based systems: [...]]]></description>
			<content:encoded><![CDATA[<p>These are excellent opportunities to work on formal methods with Pete Manolios at Northeastern.  There are two positions open: research scientist and postdoc.  Announcements for both are included below.  First, the research scientist position:</p>
<blockquote><p>Research scientist position in Formal Methods</p>
<p>Prof. Pete Manolios<br />
Northeastern University<br />
Boston, Massachusetts</p>
<p>Highly motivated applicants are being sought to work on the<br />
automation of component-based systems: from a sea of available<br />
components, which should be selected and how should they be<br />
connected, integrated, and assembled so that system-level<br />
requirements are satisfied?  We are exploring all aspects of this<br />
problem, including:</p>
<p>- the development of model-based languages for describing systems,</p>
<p>- declarative specification languages for describing assembly<br />
constraints, and</p>
<p>- the use of decision procedures based on SAT, pseudo-boolean<br />
solving, SMT, and related technologies for solving various<br />
aspects of the system assembly problem.</p>
<p>Application areas include large-scale software systems,<br />
aerospace systems, package management, and service science and<br />
engineering.</p>
<p>We are working with several industrial partners and government<br />
agencies on these projects.</p>
<p>The position involves conducting basic research, developing<br />
tools, working as part of a research team, writing grant<br />
proposals, traveling, and giving presentations.</p>
<p>Candidate Profile:</p>
<p>- PhD in Computer Science or a closely related field.<br />
- Expertise in Formal Methods and Verification technology.<br />
- Strong formal background in logic and discrete math.<br />
- Experience with SAT and SMT based decision procedures.<br />
- Very strong programming skills.<br />
- Great communication and presentation skills.<br />
- An established research record.</p>
<p>This positions will remain open until filled. It is available<br />
immediately and has an initial duration of 2-3 years.</p>
<p>Salary range: $60,000-$70,000 year.</p>
<p>Application procedure:</p>
<p>Send a cover letter, CV, research statement, and copies of up to<br />
three of your strongest publications. Also, 3 letters of<br />
recommendation must be submitted directly by your<br />
references. Please arrange for all of the above to be send via<br />
email and in pdf format to both rachelb@ccs.neu.edu and<br />
pete@ccs.neu.edu.</p>
<p>If you have any questions, please contact Pete Manolios</p>
<p>http://www.ccs.neu.edu/home/pete</p></blockquote>
<p>Here is the post-doc announcement:</p>
<blockquote><p>Postdoc position in Formal Methods</p>
<p>Prof. Pete Manolios<br />
Northeastern University<br />
Boston, Massachusetts</p>
<p>Highly motivated applicants are being sought to work on<br />
developing decision procedures that operate directly on Register<br />
Transfer Level designs. The decision procedures envisioned are<br />
based on improvements to bit-level reasoning and will provide<br />
significant advances over state-of-the-art tools by exploiting<br />
the power of theorem proving, in a fully automatic way.</p>
<p>The theorem proving system under consideration is ACL2s. See<br />
http://www.ccs.neu.edu/home/pete/acl2s/index.html.  We are<br />
interested in decision procedures for languages that include<br />
bit-vectors and arrays. A first step in this direction is the BAT<br />
system; see http://www.ccs.neu.edu/home/pete/bat/index.html.</p>
<p>We are working with several industrial partners and government<br />
agencies on these projects.</p>
<p>The position involves conducting basic research, developing<br />
tools, working as part of a research team, traveling, and<br />
giving presentations.</p>
<p>Candidate Profile:</p>
<p>- PhD in Computer Science or a closely related field.<br />
- Expertise in Formal Methods and Verification technology.<br />
- Experience with ACL2 and SAT-based decision procedures.<br />
- Strong formal background in logic and discrete math.<br />
- Very strong programming skills.<br />
- Very strong communication and presentation skills.<br />
- An established research record.</p>
<p>This position will remain open until filled. It is available<br />
immediately and has a duration of 2-3 years.</p>
<p>Salary range: $55,000-$65,000 year.</p>
<p>Application procedure:</p>
<p>Send a cover letter, CV, research statement, and copies of up to<br />
three of your strongest publications. Also, 3 letters of<br />
recommendation must be submitted directly by your<br />
references. Please arrange for all of the above to be send via<br />
email and in pdf format to both rachelb@ccs.neu.edu and<br />
pete@ccs.neu.edu.</p>
<p>If you have any questions, please contact Pete Manolios</p>
<p>http://www.ccs.neu.edu/home/pete</p></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://dvanhorn.lambda-calcul.us/2009/01/24/positions-in-formal-methods-at-northeastern/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>SK: Advice to Graduate School Recommendation Letter Writers</title>
		<link>http://dvanhorn.lambda-calcul.us/2008/03/29/sk-advice-to-graduate-school-recommendation-letter-writers/</link>
		<comments>http://dvanhorn.lambda-calcul.us/2008/03/29/sk-advice-to-graduate-school-recommendation-letter-writers/#comments</comments>
		<pubDate>Sat, 29 Mar 2008 22:31:15 +0000</pubDate>
		<dc:creator>dvanhorn</dc:creator>
				<category><![CDATA[Jobs]]></category>
		<category><![CDATA[Krishnamurthi]]></category>
		<category><![CDATA[letters]]></category>

		<guid isPermaLink="false">http://dvanhorn.lambda-calcul.us/2008/03/29/sk-advice-to-graduate-school-recommendation-letter-writers/</guid>
		<description><![CDATA[Shriram Krishnamurthi has a recent and insightful essay on writing graduate school letters of recommendation.
]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.cs.brown.edu/~sk/">Shriram Krishnamurthi</a> has a recent and insightful <a href="http://www.cs.brown.edu/~sk/Memos/Grad-School-Recos/">essay</a> on writing graduate school letters of recommendation.</p>
]]></content:encoded>
			<wfw:commentRss>http://dvanhorn.lambda-calcul.us/2008/03/29/sk-advice-to-graduate-school-recommendation-letter-writers/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Job search advice</title>
		<link>http://dvanhorn.lambda-calcul.us/2008/03/29/job-search-advice/</link>
		<comments>http://dvanhorn.lambda-calcul.us/2008/03/29/job-search-advice/#comments</comments>
		<pubDate>Sat, 29 Mar 2008 22:19:17 +0000</pubDate>
		<dc:creator>dvanhorn</dc:creator>
				<category><![CDATA[Jobs]]></category>
		<category><![CDATA[job search]]></category>
		<category><![CDATA[Might]]></category>

		<guid isPermaLink="false">http://dvanhorn.lambda-calcul.us/2008/03/29/job-search-advice/</guid>
		<description><![CDATA[Matt Might was recently in town interviewing at Brandeis.  Having been steeped in the job search process over the last year, I asked him for any advice and hints for finding open positions.  Here is response (with permission):
cra.org has the best listing.
The Chronicle of Higher Education has a listing of more teaching-oriented positions.
Other [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://matt.might.net/">Matt Might</a> was recently in town interviewing at Brandeis.  Having been steeped in the job search process over the last year, I asked him for any advice and hints for finding open positions.  Here is response (with permission):</p>
<blockquote><p><a href="http://www.cra.org/ads/">cra.org</a> has the best listing.</p>
<p>The Chronicle of Higher Education has a <a href="http://www.higheredjobs.com/faculty/search.cfm?JobCat=102">listing</a> of more teaching-oriented positions.</p>
<p>Other than that, you can search through the sites of individual schools for listings starting in September-October.</p>
<p>My advice would be:</p>
<ol start="0">
<li>Go to as many other job talks as you can.</li>
<li> Apply early (November); apply often.  (Get your materials ready now.)</li>
<li> Get your letter writers primed now.  (You&#8217;ll need at most 6, but no less than 3.)</li>
<li>Start contacting PL folks at other universities, and start having  Harry do the same, to check for open slots.</li>
<li>Keep publishing.</li>
<li>Prepare your job talk for a general audience. (Systems, graphics, databases, etc.)</li>
<li>Make sure other fields can see the possibility of collaboration. (Most the people you meet will be non-PL.)</li>
<li>Interview at a throw-away school first to test out your job talk.</li>
<li>Have your &#8220;Over the next 5 years, I see myself&#8230;&#8221; elevator pitch rehearsed and ready to fire.</li>
<li>Be prepared for productivity to grind to a halt for two months during interview season. (Don&#8217;t be dissing or defending.)</li>
<li>Buy the book &#8220;Even a Geek Can Speak.&#8221;</li>
</ol>
<p>Having now interviewed with 5 places and with 1 or 2 more to go, I might&#8217;ve been more careful about accepting interviews at places I didn&#8217;t think I&#8217;d go.  This is a <strong>grueling</strong> process.</p>
<p>Good questions to ask others:</p>
<ol>
<li>Why did you choose this school during your job search?</li>
<li>Where do you see this dept/school/college in 5 years?</li>
<li>What&#8217;s the teaching load like?</li>
<li>What&#8217;s the tenure process like?</li>
<li>Which courses need teaching?</li>
<li>What kind of start-up package do you think I should negotiate? (Ask this of asst. profs.)</li>
</ol>
<p>That&#8217;s everything I can think of off the top of my head. I&#8217;m sure more will drip out later.</p></blockquote>
<p>Other resources I&#8217;ve stumbled across are:</p>
<ul>
<li>The ACM&#8217;s <a href="http://campus.acm.org/careercenter/">Career &amp; Job Center</a>.<a href="http://campus.acm.org/careercenter/"></a></li>
<li><a href="http://www.cis.upenn.edu/~sweirich/">Stephanie Weirich</a>&#8217;s <a href="http://www.cis.upenn.edu/~sweirich/resources.htm">Computer Science Faculty Job Search Resources</a>.</li>
<li><a href="http://www.cs.rutgers.edu/~ccshan/">Ken Shan</a>&#8217;s comprehensive <a href="http://www.digitas.harvard.edu/cgi-bin/wiki/ken/AcademiaAdvice">AcademiaAdvice</a>.</li>
</ul>
]]></content:encoded>
			<wfw:commentRss>http://dvanhorn.lambda-calcul.us/2008/03/29/job-search-advice/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
