MFPS91 program

To: types
Subject: MFPS91 program
From: Stephen.Brookes@proof.ergo.cs.cmu.edu
Date: Thu, 17 Jan 91 10:40:04 EST
Sender: meyer@theory.lcs.mit.edu
Date: Wed, 16 Jan 91 15:04:56 EST
To: THEORYNT@vm1.nodak.edu, concurrency@theory.lcs.mit.edu,
        theory-logic@cs.cmu.edu, types@theory.lcs.mit.edu

	MATHEMATICAL FOUNDATIONS OF PROGRAMMING SEMANTICS (MFPS91)
		    	March 25-28, 1991
		    Carnegie Mellon University
		    School of Computer Science
		       Pittsburgh, Pa 15213

		      CONFERENCE PROGRAM

INVITED SPEAKERS
The following have agreed to be invited speakers at MFPS91:

	Jon Barwise, Indiana University
	John Reynolds, Carnegie Mellon University
	Dana Scott, Carnegie Mellon University
	Mitchell Wand, Northeastern University
	Glynn Winskel, Aarhus University



CONTRIBUTED PAPERS
The following papers have been selected by the program committee:

On Relating Concurrency and Nondeterminism
Luca Aceto (University of Sussex, UK)

HSP type theorems in the category of posets
Michael Barr (McGill University, Montreal, Canada)

Program Correctness and Matricial Theories
Stephen L. Bloom (Stevens Institute of Technology)
Zoltan Esik (A. Joszef University, Bolyai Institute, Szeged, Hungary)

Tradeoffs in true concurrency: Pomsets and Mazurkiewicz Traces
Bard Bloom (Cornell University)
Marta Kwiatkowska (University of Leicester, UK)

Continuous Functions and Parallel Algorithms on Concrete Data Structures
Stephen Brookes and Shai Geva (Carnegie Mellon University)

The Equivalence of Two Semantic Definitions for Object-Oriented Languages
Kim B. Bruce (Williams College)

Call-by-Value Combinatory Logic and the Lambda-Value Calculus
Bruce F. Duba and John Gateley (Rice University)

Simultaneous Substitution in the Typed Lambda Calculus
John Gray (University of Illinois at Urbana-Champaign)

An Upper Power Domain Construction in terms of Strongly Compact Sets
Reinhold Heckmann (Universitat des Saarlandes, Saarbrucken)

Cartesian Closed Categories of Domains and the Space Proj(D)
Michael Huth (Tulane University)

Decomposition of Domains			
Achim Jung (Technische Hochschule Darmstadt, Germany)
Leonid Libkin (University of Pennsylvania)
Hermann Puhlmann (Technische Hochschule Darmstadt, Germany)

On Continuous Time Agents
S. Kasangian (University of Milan, Italy)
A. Labella (University of Rome, Italy)

Liminf Progress	Measures
Nils Klarlund (IBM Thomas J. Watson Research Center)

Typed Homomorphic Relations Extended with Subtypes
Gary T. Leavens and Don Pigozzi (Iowa State University)

Equations for if-then-else
Ernest G. Manes (University of Massachusetts, Amherst)

Connections
Austin Melton, Bernd S. W. Schroeder, and George E. Strecker 
(Kansas State University)

An Algorithm for Analyzing Communicating Processes
Nicolas Mercouroff (LIX, Ecole Polytechnique, France; and Brandeis University)

A Simple Language Supporting Angelic Nondeterminism and 
Parallel Composition	
Michael W. Mislove (Tulane University)
Frank J. Oles (IBM, Thomas J. Watson Research Center)

Primitive Recursive Functionals	with Dependent Types
Neal Nelson (Oregon Graduate Institute)

An exper model for Quest
Giuseppe Rosolini (University of Parma, Italy)

Nonwellfounded Sets and Programming Language Semantics
J.J.M.M. Rutten (Center for Mathematics and Computer Science, Amsterdam)

>From Operational to Denotational Semantics
Scott F. Smith (The Johns Hopkins University)

A Monoidal Closed Category of Event Structures
Guo Qiang Zhang (University of Georgia)


FURTHER DETAILS
The schedule of talks will be posted later.
Local arrangements and travel information appear in separate message.

ACKNOWLEDGEMENTS
The organizers of MFPS91 are pleased to acknowledge the support of
the Office of Naval Research (Computer Science Division).