Peter Møller Neergaard

(pronunciation (slow) turtle@achilles.linearity.org, snail mail, PGP welcome)
My picture

I am 34 year old Dane living in the great city of Boston. I work as an internal consultant for Ab Initio Software Corporation.

I did my PhD studies as part of the Linear Naming and Computation Group at the School of Computer Science at Brandeis University. I am an alumni of the Church Project at Boston University.

My dissertation covers complexity aspects of programming languages design. I prove that idempotency is crucial for efficient type inference with intersection types. This result provides a formal links between linear logic and expansion variables proposed by Kfoury and Wells. I provide what appears to be the first resource-independent characterization of the functions computable in logarithmic space.

I attempt to live a varied life, so I have various quite unrelated interests

(Clicking on a picture let's you follow the link)

As for my academic career, I am interested in programming languages and complexity. I had the pleasure of being advised by Prof. Harry Mairson (see picture on the right).

  • I have developed a recursion principle called safe affine course-of-values recursion (slightly stronger than primitive recursion) to provide what appears to be the first resource-independent characterization of the functions computable in LOGSPACE.
  • With Prof. Harry Mairson, I have proven that it is crucial that the type system is forgetful to achieve feasible type inference with intersection types.
  • I have established a formal relation between proofnets in linear logic and expansion variables proposed for type inference with intersection types.
  • I have shown that Bellantoni Cook's notion of safe recursion and composition is strictly stronger than Light Affine Logic.
  • With Prof. Harry Mairson I have proven that the linear version of Bellantoni and Cook's system can be evaluated in LOGSPACE. I have developed an example implementation in ML.
Prof. Mairson

My master's thesis discuses ways to infer strong normalization from weak normalization for classical first-order logic. It was completed at the Dept. of Computer Science at University of Copenhagen and advised by Morten Heine Bjørnlund Sørensen

 DIKU
I was a dedicated scout when living in Denmark. I have served one year as one of two chairmen of the Denmark-Ghana cooperation between the The Danish Guide and Scout Association, The Ghana Scout Association, and Ghana Girl Guides Association. I have also been a pioneer at Gurredam Scout Center DDS
I've become addicted to running marathon and have so far completed Copenhagen, Philadelphia, and Boston. Next up is Chicago.  
I am quite a LAT EX-fan  

Contents

  1. Contact information: how to call or snail mail me.
  2. My Curriculum Vitae: This is how I have spent my first 34 years on the earth.
  3. Academic Work: This is the short list of my different academic works.
  4. Wishes for Presents: This is the right place to look if you plan on presenting me a gift (but then again, why should you?).
  5. LAT EX: I have made some small packages for LAT EX

How to Find Me: Brandeis University

I have office Volen 133-135.

You can reach me by campus phone 6 2716 or directly at +1 781 736-2716.

I have separate information on my mailing addresses.

LATEX-packages

Valid HTML 4.01! This page is valid HTML 4.01. In case of markup problems you should contact the developer of your browser.
Peter Møller Neergaard.
Autogenerated on Saturday October 20 2007. Last modified: Mon, October 18, 2004 12:48