Logo
PARTICIPANTS
SCHEDULE
REPORTS
MAILING LIST
HACKERS' GUIDE
HOME
 

The Church Project Seminar Schedule

Coordinators:

  • From September 2005, the seminar is coordinated by Sugwoo Byun.
  • From September 2004 to August 2005, the seminar was coordinated by Dengping Zhu.
  • From September 2003 to August 2004, the seminar was coordinated by Mark Sheldon.
  • From February 2003 to September 2003, the seminar was coordinated by Chiyan Chen.
  • From April 2002 to January 2003, the seminar was coordinated by Gang Chen.
  • Before April 2002, the seminar was coordinated by Torben Amtoft.

    •  

     

Where:

MCS 180
Computer Science Department
Boston University
111 Cummington Street
Boston, MA 02215 

When:

For Sprint 2006, the meetings typically take place on Monday, at 3:00pm. Please refer to the announcements for the precise time and date for each meeting.

Call for Talks

Topics related to programming languages, type theory, logics, compiler techniques, software engineering are welcomed. Please write to swbyun at types.bu.edu to schedule a presentation at the Church seminar series. 

Meetings

Date Speaker Topic Abstract Report
April 11, 2006 Sukyoung Ryu Formailsim in the Fortress Programming Languages Abstract
Nov. 15, 2005 Anindya Banerjee A Logical Specification of Information Flow Analysis Abstract
Nov. 2, 2005 Aleks Nanevski A Modal Approach to Functional Programming Abstract Slides(pdf)
Oct. 19, 2005 Gang Tan A Compositional Logic for Control Flow Abstract Slides(pdf)
Oct. 4, 2004 Peter Møller Neergaard A Functional Language for Logarithmic Space Abstract  
Nov. 1, 2004 Adam Bakewell Unification With Expansion Variables Abstract Slides(ps)
Nov. 8, 2004 Franklyn A. Turbak A Tutorial on Information Flow Abstract  
Nov. 29, 2004 Santiago Pericas-Geertsen Is XML a flexible format? Abstract Slides(pdf)
Dec. 6th, 2004 Suad Alagic Type Erasure: Breaking the Java Type System Abstract Slides: (ppt) (pdf)
 
Date Speaker Topic Abstract Report
Apr. 22, 2004 Kenichi Asai, Northeastern University Writing Compiler Optimizations Using Fold and Build    
Apr. 15, 2004 Stephen McCamant, MIT Compatibility in Multi-Component Upgrades (tentative)    
Apr. 8, 2004 Kim Bruce, Williams College LOOJ: Weaving LOOM into Java    
Apr. 1, 2004 Dan Dougherty, WPI Characterizing Strong Normalization in a Language with Control Operators [Abstract]  
Mar. 18, 2004 Greg Morrisett, Harvard University Implementing a Garbage Collector in Cylclone [Abstract]  
Feb. 26, 2004 No meeting.      
Feb. 19, 2004 Joe Wells, Heriot-Watt University A Brief Tutorial on Expansion in Intersection Types [Abstract]  
Feb. 12, 2004 Philipe Meunier, Northeastern University Modular Set-Based Analysis from Contracts [Abstract]  
Dec. 18, 2003 Dan Dougherty, Worcester Polytechnic Institute Intersection Types and Explicit Substitutions [Abstract]  
Dec. 11, 2003 Allyn Dimock, U Mass, Lowell Status of the Church Compiler: Lessons, Future Directions [Abstract]  
Dec. 4, 2003 Norman Ramsey, Harvard University Choosing Abstractions and Interfaces for Programming-Language Infrastructure [Abstract]  
Nov. 27, 2003 No meeting: Thanksgiving      
Nov. 20, 2003 Adam Bakewell Shape Checking for Pointer Safety [Abstract] Web site
Nov. 13, 2003 Adam Bakewell Specifying Pointer Structures by Graph Reduction [Abstract] Web site
Nov. 6, 2003 Kirsten Chevalier, UC Berkeley Type-inference-based Deforestation as a Source-to-Source transform in the Glasgow Haskell Compiler [Abstract]  
Oct. 30, 2003 No Meeting      
Oct. 23, 2003 Hongwei Xi Expressing Modular Structure through Local Bindings on Global Identifiers [Abstract]  
Oct. 16, 2003 No Meeting      
Oct. 9, 2003 Christopher Fry (Clear Methods) The Water Programming Language    
Oct. 2, 2003 Lyn Turbak and Mark Sheldon A Module System with Static Dependent Types (continuation of previous talk) [Abstract]  
Sept. 25, 2003 Mark Sheldon and Lyn Turbak A Pedagogy of Abstract Types [Abstract]  
Sept. 18, 2003 Santiago Pericas-Geertsen (Sun Microsystems) Fast Web Services    
Date Speaker Topic Abstract Report
June 2, 2003 Torben Amtoft The Semantic Soundness of a Type System for Interprocedural Register Allocation and Constructor Flattening    
March 24, 2003 Santiago Pericas-Geertsen (Sun Microsystems) Transforming the future of Transformations [Abstract]  
March 3, 2003 Chiyan Chen A Type System for Scoped Memory Management [Abstract] ps
February 24, 2003 Al Strelzoff Functional Programming in Embedded System Design [Abstract]  
February 10, 2003 Chung-chieh Shan LINGUISTIC SIDE EFFECTS [Abstract]  
January 30, 2003 Sebastien Carlier Rewrite Rules for Beta-Unification [Abstract]  
January 27, 2003 Christian Skalka Types for Access Control: Foundations and Methodology [Abstract]  
December 16 , 2002
Torben Amtoft presents Causal Type System for Ambient Movements . [Abstract]
December 2 , 2002
Gang Chen presents Coercive Subtyping in the Calculus of Constructions . [Abstract]
November 18 , 2002
Chiyan Chen presents Implementing Meta-Programming (II). [Abstract]
November 11 , 2002
Chiyan Chen presents Implementing Meta-Programming (I) . [Abstract]
November 4 , 2002
Hongwei Xi presents Implementing Object-Oriented Programming in Typed Functional Programming. [Abstract]
October 21 , 2002
Carsten Schuermann presents About None-Theorems and how to recognize them early. [Abstract]
October 7 , 2002
Joe Wells presents Rewriting in the Design of Type Systems . [Abstract]
September 30 , 2002
Joe Wells presents Shape Types for Ambients with Communication Dependencies . [Abstract]
June 17 , 2002
Bob Muller presents The TERM Machine : Sound Interprocedural Register Allocation with Constructor Flattening .
September 30 , 2002
Joe Wells presents Shape Types for Ambients with Communication Dependencies . [Abstract]
June 17 , 2002
Bob Muller presents The TERM Machine : Sound Interprocedural Register Allocation with Constructor Flattening . [Abstract]
May 20 , 2002
Bob Muller presents Inferring Annotated Types for Interprocedural Register Allocation with Constructor Flattening . [Abstract]
Apr 4 , 2002
Francois Metayer presents Geometric aspects of rewriting . [Abstract]
Dec 3 , 2001
Peter Møller Neergaard presents LAL is square. [Abstract]
Nov 26, 2001
Walid Taha presents MetaOCaml: Multi-Stage Programming for the Masses![Abstract]
Nov 19, 2001
Hongwei Xi presents Passing Proofs of Intensional Type Predicates. [Abstract]
Nov 12, 2001
Gang Chen presents Subtyping and if-expressions -- A type checking problem in the Java type system . [Abstract] [Slides]
Oct 1, 2001
Chandrasekhar Boyapati presents A Parameterized Type System for Race-Free Java Programs. [Abstract]
Sep 24, 2001
Franklyn Turbak presents Cycle Therapy: a Prescription for Fold and Unfold on Regular Trees. [Abstract]
Sep 17, 2001
Geoff Washburn presents Visualizing Run-time Code Generation: An Application of Modal Types . [Abstract]
May 7, 2001
Ian Westmacott presents Region Inference with Intersection Types and its Formalization in Isabelle. [Abstract]
April 23, 2001
Patrik Jansson presents Functional Polytypic Programming. [Abstract][Slides]
March 12, 2001
Jens Palsberg presents Static Checking of Interrupt-driven Software. [Abstract]
Feb 5, 2001
Santiago Pericas-Geertsen presents Channeled Ambients. [Abstract]
Dec 12, 2000
Jeffrey Mark Siskind presents Flow-Directed Lightweight Closure and CPS Conversion. [Abstract]
Dec 11, 2000
Anindya Banerjee presents Semantics-based Design and Correctness of Control-flow Analysis-based Program Transformations. [Abstract]
Dec 4, 2000
Harry Mairson presents Proofnets for classical logic. [Abstract]
Nov 20, 2000
Peter Møller Neergaard presents Normalization by Evaluation. [Abstract]
Oct 23, 2000
Harry Mairson presents Logspace and linearity: analyzing the linear fragment of the Bellantoni-Cook PTIME function algebra. [Abstract]
Oct 16, 2000

(Note: at 3pm, in MCS 135)
Robert Bruce Findler (Rice University) presents Contracts for Java. [Abstract]
Oct 2, 2000
Joe Wells presents Equational Reasoning for Linking with First-Class Primitive Modules. [Abstract]
Sep 25, 2000
Michael Ernst presents Dynamically Detecting Likely Program Invariants. [Abstract]
Sep 11, 2000
Luke Ong presents Connexions between recent resource-free characterizations of PTIME.
May 8, 2000
Bennett Yates presents several papers on the foundation of mobility. [Abstract]
April 10, 2000
Paul Blain Levy presents Call-by-Push-Value: A Subsuming Paradigm. [Abstract]
April 3, 2000
Jeffrey Considine presents Deciding Isomorphism of Simple Types in Polynomial Time. [Abstract]
March 20, 2000
Elena Machkasova, Julia Lawall and Torben Amtoft rehearse their ESOP presentations [Abstracts]
March 13, 2000
Chris Okasaki presents The Practice and Theory of Nested Types. [Abstract]
February 28, 2000
Torben Amtoft presents Faithful Translations between Polyvariant Flows and Polymorphic Types. [Abstract]
February 14, 2000
Elena Machkasova presents A Calculus for Link-time Compilation. [Abstract]
February 7, 2000
Peter Møller Neergaard presents Weak and Strong Normalisation, K-redexes and First-Order Logic. [Abstract]
December 13, 1999
Santiago Pericas-Geertsen presents Depth Subtyping and Type Inference for Object Calculi. [Abstract]
December 6, 1999
Charles Stewart presents Algebraic semantics of linear logic. [Abstract]
November 22, 1999
Harry Mairson presents Algorithmic correctness of optimal reduction (part II of his talk October 18). [Abstract]
November 15, 1999
Alan Bawden presents Using Linear Naming to Build Distributed Systems. [Abstract]
October 25, 1999
Alan Bawden presents First-class Macros Have Types. [Abstract]
October 18, 1999
Harry Mairson presents Context semantics of graph reduction. [Abstract]
October 4, 1999
Bennett Yates presents Monadic Encapsulation in ML and A Type-and-effect System for the Encapsulation of Memory in Java. [Abstract]
May 3, 1999
Michele Bugliesi and Santiago Pericas-Geertsen present Depth Subtyping and Type Inference for Object Calculi. [Abstract]
April 12, 1999
Ian Westmacott presents Isabelle 98: A User Report. [Abstract]
March 29, 1999
Torben Amtoft presents Type and Effect Systems: Behaviours for Concurrency [Abstract]
March 15, 1999
Jens Palsberg of Purdue University presents From Polyvariant Flow Information to Intersection and Union Types [Abstract]
March 1, 1999
Kim Bruce, of Williams College, presents Statically Type-Safe Virtual Types: Adding expressiveness and safety to object-oriented languages [Abstract]
February 19, 1999, 3:00 to 5:00 p.m.
Franklyn Turbak presents current work on the time complexity for deciding the typability of terms in the system of finite-rank intersection types. [Abstract]
December 21, 1998
Franklyn Turbak concludes his presentation of Principality and Decidable Type Inference for Finite-Rank Intersection Types [Abstract] by Assaf Kfoury and Joe Wells. (To be presented at POPL '99.)
December 7, 1998
Franklyn Turbak presents Principality and Decidable Type Inference for Finite-Rank Intersection Types [Abstract] by Assaf Kfoury and Joe Wells. (To be presented at POPL '99.)
November 23, 1998
Santiago Pericas-Geertsen presents Type Inference with Recursive Types and Object Types [Abstract] (joint work with Assaf Kfoury as part of the speaker's master's-thesis research).
November 23, 1998 at 2:00 p.m.
Yves Bertot of INRIA presents Mechanizing the Proof of Correctness of a Compiler using Type Theory [Abstract].
November 9, 1998
Elena Machkasova presents Program Optimization for Separate Module Compilation [Abstract] (work in progress by the speaker and Franklyn Turbak).
October 26, 1998
Members of the Church compiler implementation team present a review of the status of the compiler.
May 18, 1998
Allyn Dimock presents
May 11, 1998
Meeting Summary. Olin Shivers of MIT presents his recent work on a type system to describe continuations.
March 30, 1998
Meeting Summary. Status review on the Church compiler.
March 16, 1998
Ian Westmacott gives a tutorial introduction to the Isabelle theorem prover. [Abstract].
March 9, 1998
Paul Steckler describes FiSh, a language and system for array programming [Abstract].
February 23, 1998
Meeting Summary. Joe Wells presents:
  • Rewriting theory in programming language semantics.
  • An introduction to explicit substitution.
February 2, 1998
Project overview. Several members of the Church group describe the status of the subprojects they've been working on.
November 24, 1997
Meeting Summary. John Hannan of Pennsylvania State University presents joint work with Patrick Hicks: Higher-Order UnCurrying [Abstract]
November 17, 1997
Meeting Summary. Bob Muller concludes his presentation from November 3 (see below).
November 3, 1997
Meeting Summary. Bob Muller presents
October 20, 1997
Meeting Summary. Elena Machkasova concludes her presentation from October 6 (see below).
October 6, 1997
Meeting Summary.
  • Allyn Dimock concludes his presentation from September 29 (see below).
  • Elena Machkasova presents
September 29, 1997
Meeting Summary. Allyn Dimock presents
June 2, 1997
Meeting Summary. Lyn Turbak presents a dry run of his TIC talk.
May 28, 1997 (Wednesday)
Joe Wells presents joint work in progress with Scott Smith and Valery Trifonov of Johns Hopkins University: Explicitly Typed Sharing Graphs for Polyvariant Flow Analysis. [Abstract]
May 26, 1997
Memorial Day. No meeting.
May 19, 1997
Meeting Summary. Assaf Kfoury presents work-in-progress: Recursion, tail recursion and iteration at higher order
May 12, 1997
Meeting Summary. Harry Mairson presents joint work with Andrea Asperti of the University of Bologna: Parallel beta reduction is not elementary recursive. [Abstract]
May 5, 1997
Meeting Summary. Lyn Turbak presents
April 28, 1997
Meeting Summary. Dan Bachiochi and Gary MacDonald present their implementation of loop identification using DJ graphs. DJ graphs and their use for loop analysis are described in
April 21, 1997
No meeting.
April 14, 1997
Meeting Summary. Bob Muller describes the Lévy/Huet approach to standardization and its application to the Church intermediate language lambda-CIL.
April 7, 1997
Meeting Summary.
  • Joe Wells presents "A Typed Intermediate Language for Flow-Directed Compilation" by himself, Allyn Dimock, Bob Muller, and Lyn Turbak. (Joe's TAPSOFT presentation on April 16.)
  • Joe then discusses alternate ways of formulating intersection types in an explicitly typed manner. He presents a simple generalization of Girard's F_omega which allows encoding typings of the intersection type discipline in the generalized F_omega without any loss of information.
March 31, 1997
No meeting.
March 25, 1997.
Zena Ariola of the University of Oregon presents Cyclic Lambda Calculi (joint work with Stefan Blom).
March 24, 1997
No meeting.
March 17, 1997
No meeting.
March 10, 1997
Meeting Summary. Allyn Dimock presents work in progress on control flow analysis.
March 3, 1997
Meeting Summary. Ian Westmacott discusses the approach to polymorphic recursion described in
  • Trevor Jim. Rank-2 Type Systems and Recursive Definitions. Technical Report MIT/LCS/TM-531, MIT, 1995.
February 24, 1997
Meeting Summary. Bob Muller concludes the presentation on cyclic lambda calculi that he started on February 3.
February 17, 1997
No meeting.
February 10, 1997
Meeting Summary. Lyn Turbak outlines the issues in implementing intermediate representations, presents several alternatives, and leads a discussion of their merits and demerits.
February 3, 1997
Meeting Summary. Bob Muller begins presentation of work on cyclic lambda calculi by Ariola and Klop (Inf. & Comp. '96) and by Ariola and Blom (unpublished).
January 27, 1997
Meeting Summary. Allyn Dimock gives an overview of control flow analysis and then presents the framework described in:
  • F. Nielson and H. Nielson. Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis, POPL '97.
January 20, 1997
Meeting Summary. Ian Westmacott discusses runtime type recovery for garbage collection, as exemplified in:
  • Appel. Runtime Tags Aren't Necessary.
  • Tolmach. Tag-free Garbage Collection Using Explicit Type Parameters.
  • Aditya, Flood, and Hicks. Garbage Collection for Strongly-typed Languages using Run-time Type Reconstruction.
January 13, 1997
Meeting Summary. Joe Wells discusses Combinatory Reduction Systems (CRS's), devised by Klop as a generalization of the lambda calculus and term rewriting systems. Many of the useful properties of the lambda calculus have also been proven for CRS's. Joe shows how he has recently used the CRS technology to prove the confluence of a calculus we are using.
December 23 and 30, 1996 and January 6, 1997
No meetings.
December 16, 1996
Meeting Summary. Ian Westmacott presents an overview of some recent papers on garbage collection.
December 9, 1996
Meeting Summary and Addendum. Santiago Pericas concludes his presentation on:
  • Odersky and Wadler. Pizza into Java: Translating Theory into Practice.
He then presents the related paper:
  • Myers, Bank, and Liskov. Parameterized Types for Java.
December 2, 1996
Meeting Summary. Harry Mairson of Brandeis University presents: A brief introduction to optimal evaluation

Related papers:
November 25, 1996
Meeting Summary, part one. Santiago Pericas presents the paper:
  • Odersky and Wadler. Pizza into Java: Translating Theory into Practice.
Meeting Summary, part two. Alex Sorg presents the paper:
  • Chi-Keung Luk and Todd C. Mowry. Compiler-Based Prefetching for Recursive Data Structures.
November 18, 1996
Meeting Summary. Greg Sullivan of Northeastern University presents joint work with Mitch Wand: Operational Models for Higher-Order Imperative Languages
November 11, 1996
No meeting.
November 4, 1996
Meeting Summary. Glenn Holloway describes the portable backend of the SML/NJ compiler and discusses pros and cons of using it in our CL compiler.
October 28, 1996
Meeting Summary. Lyn Turbak presents proposed improvements to the general transformation framework that developed during last summer's Church Project work on closure conversion.
October 21, 1996
Meeting Summary. Joe Wells presents a Church Project overview for the benefit of potential new project members (and old ones too).
October 14, 1996
Columbus day. No meeting.
October 7, 1996
Meeting Summary. Working meeting to settle technical issues for a forthcoming paper.
September 30, 1996
Meeting Summary. Katherine St. John of U. Penn. speaks on "Recursion and Iteration over Finite Structures". Then Elena presents the Fernandez paper "Simple and Effective Link-Time Optimization of Modula-3 Programs" (PLDI '95).
September 23, 1996
Meeting Summary. Lyn presenting the Plevyak/Chien papers "Type Directed Cloning for Object-Oriented Programs" and "Automatic Interprocedural Optimization for Object-Oriented Languages". Elena presenting the Dean/Chambers/Grove paper "Selective Specialization for Object Oriented Languages".
September 16, 1996
Meeting Summary. Working meeting to plan future meetings and publication strategies. Bob Muller announced the Types In Compilation (TIC) workshop, to be held on June 8, 1997, in Amsterdam, preceding ICFP.
September 9, 1996
No meeting.
September 2, 1996
Labor day. No meeting.
August 26, 1996
Working meeting on storage allocation analysis (i.e., regions).
August 23-24, 1996
Meeting Summary.
11:00 a.m.
Overview of Church Group work.
2:30 p.m.
Leszek Pacholski will talk about solving systems of set inclusions. This is related to the type inference work of Aiken/Wimmers.
3:30 p.m.
Scott Smith and Valery Trifonov will talk about their work on constrained type inference.
August 19, 1996
Meeting Summary. Assaf Kfoury presenting his paper "A Linearization of the Lambda Calculus and Consequences".
August 12, 1996
Meeting Summary. Ian Westmacott will discuss memory management. Recommended reading is:
  • Felleisen, Harper, and Morrisett. Abstract Models of Memory Management.
  • Talpin, Tang. A Syntactic Approach to Inferring the Life-time of Data-regions. 1995.
August 5, 1996
No meeting.
July 29, 1996
No meeting, since too many people will be gone.
July 22, 1996
Meeting Summary. Bob/Joe/Lyn/Allyn will present the Church Project closure conversion paper.
July 15, 1996
Meeting Summary. Glenn Holloway will discuss representation types and boxing.
July 8, 1996
Meeting cancelled.
July 1, 1996
Meeting Summary. Working meeting on closure conversion.
June 24, 1996
Meeting Summary. Lyn Turbak presents the latest state of the closure conversion specification and algorithm.
June 17, 1996 at 1:00 p.m.
Meeting Summary. Topics of previous week will be finished.
June 10, 1996
Meeting Summary. Joe Wells will present further information on Church-style intersection types without subterm duplication. Bob Muller will finish his presentation on A-nf which he started on May 6, 1996. (Latter didn't actually happen. Don't worry, we'll get to this someday.)
June 3, 1996 at 11:00 a.m.
Meeting Summary. Ian Westmacott will present region inference and lifetime analysis in the CL compiler. An operational semantics and algorithm will be distributed.
Thursday, May 23, 1996 at 3:00 p.m.
Anindya Banerjee will talk about "Polyvariant Flow Analysis and Rank-2 Intersection Types".
May 20, 1996
Meeting Summary. Bob Muller, Lyn Turbak, and/or Joe Wells will discuss closure conversion in the Church compiler.
May 13, 1996
Meeting Summary. Joe Wells will present a Church-style version of intersection and union types that does not duplicate subterms. Bob Muller will finish his presentation about Bform and A-nf. (Latter didn't actually happen.)
May 6, 1996
Meeting Summary. Glenn Holloway will discuss representations used in the back end of the the TIL compiler, mainly based on the PLDI '96 paper. Bob Muller will present a translation from Church R3 to an A-nf/Bform-like representation.
April 29, 1996
Meeting Summary. At 4:00 p.m. at Harvard Aiken 101, we will attend Jens Palsberg's talk on a type system equivalent to control flow analysis.
April 22, 1996
Meeting Summary. Meeting at 2:00 p.m. at Harvard in Pierce 114 on Oxford St. Allyn Dimock to discuss control-flow-analysis-directed inlining. This may include a comparison of various strategies: Appel's approach, "ultra-beta", the SPJ PLDI '96 paper.


At 4:00 p.m. there is a talk by Mark Leone at Harvard on "Automatic Program Optimization at Run time" which many of us will attend.

April 8, 1996
Meeting Summary. Presentation on the relation between universal, intersection, and product types with their duals the existential, union, and disjoint union (sum) types. Ideas on how to do higher-rank intersection and union types without duplicating subterms.
April 1, 1996
Meeting Summary. Ian Westmacott to discuss more on memory region inference and representation choice. Recommended reading:
  • An Optimizing Backend for the ML Kit Using a Stack of Regions.
March 25, 1996
Meeting Summary. Bob Muller will tell us about KAM, the Kit Abstract Machine.
March 18, 1996
Meeting Summary. Overview of control flow analysis techniques. Allyn Dimock will summarize the current literature on this and his own knowledge.
March 11, 1996
Meeting Summary. Presentation on modular "mix and match" compilation techniques by Lyn Turbak.
March 4, 1996
Meeting Summary. Working meeting to discuss goals and progress.
February 26, 1996
Meeting Summary. Presentation/discussion of operational semantics for region inference developed by Ian Westmacott and Bob Muller. A working copy of the document is in file://csa.bu.edu/sw/research/church/reg-rules.ps.
February 12, 1996
Meeting Summary. Working meeting on inductive datatypes and record types.
February 5, 1996
Meeting Summary. Summary of implementation work so far. Discussion of issues raised during implementation. Discussion of future directions for the project.
December 18, 1995
Meeting cancelled. This was going to be Bob Muller discussing the region-based memory management techniques of Tofte and Talpin again. We will try to reschedule Bob's presentation.
December 4, 1995
Lyn Turbak will discuss how inductive data types are handled in the ML type system, in the XML system of Harper and Mitchell, and how they will be handled in our type system.
November 20, 1995
Meeting Summary. Allyn Dimock will talk about research by Harper and Morriset on a particular way of using types in the back-end of the compiler. Recommended reading is:
  • R. Harper and G. Morrisett. Compiling Polymorphism Using Intensional Type Analysis.
November 13, 1995
Meeting Summary. Ian Westmacott will discuss memory management work by Tofte and Talpin and related work by Aiken et al. The recommended reading is:
  • M. Tofte and J.-P. Talpin. Implementation of the Typed Call-By-Value Lambda-Calculus Using a Stack of Regions.
November 6, 1995
Meeting Summary. Presentation of type system proposed for use in implementation.
October 30, 1995
Meeting Summary. Presentation by Allyn Dimock on certain aspects of compiling functional programming languages. Recommended reading:
  • Z. Shao and A. Appel. A Typed Based Compiler for Standard ML.
This is also a working meeting.
October 23, 1995
Meeting Summary. Adding pairing and projection in the type system. Handling of recursion and simultaneous recursion in the type system. Discussion of operational semantics. Joe Wells and Trevor Jim.
October 16, 1995
Meeting Summary. Discussion of operational semantics and abstract syntax by Lyn Turbak. Discussion of concrete syntax by Ian Westmacott.
October 2, 1995
Meeting Summary. Presentation on the rank-2 restriction of intersection types by Trevor Jim.
September 25, 1995
Meeting Summary. Working meeting to determine an initial abstract syntax and operational semantics that is sufficient to allow work to begin on the compiler. Bob Muller will provide an agenda.
September 18, 1995
Meeting Summary. Presentation on compiling function programming languages. Discussion of definition of operational semantics and abstract syntax. Suggested reading:
  • Z. Shao and A. Appel. Space Efficient Closure Representations.
  • Z. Shao and A. Appel. A Typed Based Compiler for Standard ML.
September 11, 1995
Meeting Summary. Organizational meeting. Introduction to basics of ML type system and its theoretical foundation. Presentation of advantages of our alternative. Suggested reading:
  • R. Harper and J. Mitchell. On the Type Structure of Standard ML.
  • A. Appel. A Critique of Standard ML.
  • D. MacQueen. Reflections on Standard ML.
 

This page is maintained by Dengping Zhu. Autogenerated on Thursday April 13 2006.