semantics talks at Kansas State, aug-sep, 91

Date:  Tue, 13 Aug 91 12:13:52 -0500

			Series of Research Talks on
	Functional Programming and Semantics of Programming Languages

		Department of Computing and Information Sciences
			  Kansas State University
			     Manhattan, Kansas
		      26 August & 2-6 September, 1991

The Computing and Information Sciences Department is sponsoring a series
of informal research talks on functional programming and semantics of
programming languages.  The talks feature speakers from the Universities
of Aarhus and Copenhagen (Denmark), Rennes (France), Glasgow (Scotland),
Nijmegen (the Netherlands), Imperial College (England), as well as local
speakers of various nationalities (Denmark, France, India, Korea, Poland,
Rumania, and USA).

<The following program is preliminary.>

***** Program of Monday, August 26

Flemming Nielson (University of Aarhus, Denmark)
"On the Complexity of Static Program Analysis"

Hanne Riis Nielson (University of Aarhus, Denmark)
"Techniques for Transforming Functional Programs"

***** Program of Monday, September 2 

John O'Donnell, (University of Glasgow, Scotland)
"Calculating Parallel Algorithms"

Cordelia Hall (University of Glasgow, Scotland)
"How to Persuade a Typechecker to do Strictness Analysis"

Kyung-Goo Doh (Kansas State University)
"Extraction of Strong Typing Laws from Action Semantics Definitions"

Olivier Danvy (Kansas State University)
"For a Better Support of Static Data Flow"

***** Program of Tuesday, September 3

Daniel Le Metayer (University of Rennes, France)
"Parallel implementation of functional languages"

Pascal Fradet (University of Rennes, France)
"Syntactic Detection of Single-Threading using Continuations"

Thomas Jensen (Imperial College, England)
"Abstract Interpretation and Programming Logics"

Karoline Malmkjaer (Kansas State University)
"On Static Properties of Specialized Programs"

***** Program of Wednesday, September 4

Peter Sestoft (University of Copenhagen, Denmark)
"Evaluation Order Analysis for Lazy Data Structures"

Maria Zamfir-Bleyberg (Kansas State University)
"Using And/Or Algebraic Theories in Concurrency"

Masaaki Mizuno and David Schmidt (Kansas State University)
"A security flow control algorithm and its denotational
semantics-based correctness proof"

***** Program of Thursday, September 5

Erik Meijer (University of Nijmegen, the Netherlands)
"More Advice on Proving Compilers Correct: Improve Correct Compilers"

David Schmidt (Kansas State University)
"Action Semantics-based Language Design"

Olivier Danvy (Kansas State University)
"Free Wheeling between Direct and Continuation-Passing Styles"

***** Program of Friday, September 6

Gurdip Singh (Kansas State University)
"Parallel Composition of Distributed Protocols"

Jan Chomicki (Kansas State University)
"Language Constructs for Schema Restructuring in Heterogenous
Object-Oriented Databases (preliminary report)"

Practical arrangements:

The talks will be located at the Union.

Getting to Manhattan: The nearest major airport is Kansas City.  If
you fly USAir, it is possible to extend your ticket with a round-trip
connection between Kansas City and Manhattan for $30 (you are advised
to get your boarding pass on the first check-in).  Otherwise, the
connection costs around $100.  Two companies (Travellers Express and
RoadRunner) offer minibus shuttle service between Kansas City
International airport (gate 51 + pickup at all the terminals) and any
place in Manhattan for around $30 each way ($50 for a round trip).

Lodging: There are several hotels to serve you.  Ramada Inn
(913-539-7531) (across the street from the university), Holiday Inn
(913-539-5311), Days Inn (913-539-5391), and the Best Western

There is no registration fee and there will be no proceedings.  If you
would like to give a talk, please contact David Schmidt
(schmidt@cis.ksu.edu) and Olivier Danvy (danvy@cis.ksu.edu) at the
Department for Computing and Information Sciences, Kansas State
University, Manhattan, KS 66506, USA.  Phone number: (913) 532-6352.
Fax number: (913) 532-7353.  E-mail contact is preferred.