## Mathematical Foundations of Programming Language Semantics: 3rd Workshop Tulane University, New Orleans, Louisiana, USA, April 8–10, 1987 ProceedingsMichael Main, Austin Melton, Michael Mislove, David Schmidt This volume is the proceedings of the 3rd Workshop on the Mathematical Foundations of Programming Language Semantics held at Tulane University, New Orleans, Louisiana, April 8-10, 1987. The 1st Workshop was at Kansas State University, Manhattan, Kansas in April, 1985 (see LNCS 239), and the 2nd Workshop with a limited number of participants was at Kansas State in April, 1986. It was the intention of the organizers that the 3rd Workshop survey as many areas of the Mathematical Foundations of Programming Language Semantics as reasonably possible. The Workshop attracted 49 submitted papers, from which 28 papers were chosen for presentation. The papers ranged in subject from category theory and Lambda-calculus to the structure theory of domains and power domains, to implementation issues surrounding semantics. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

I | iii |

II | 23 |

III | 43 |

IV | 57 |

V | 85 |

VI | 121 |

VII | 134 |

VIII | 161 |

XVIII | 344 |

XIX | 364 |

XX | 372 |

XXI | 386 |

XXII | 414 |

XXIII | 425 |

XXIV | 444 |

XXV | 455 |

IX | 173 |

X | 200 |

XI | 213 |

XII | 236 |

XIII | 254 |

XIV | 289 |

XV | 303 |

XVI | 312 |

XVII | 331 |

XXVI | 476 |

XXVII | 490 |

XXVIII | 528 |

XXIX | 550 |

XXX | 572 |

XXXI | 599 |

XXXII | 616 |

### Other editions - View all

### Common terms and phrases

abstract action adjoint algebraic lattice algebraic types applied arrows assertional category axioms bialgebra bound called cartesian closed cartesian closed category Cauchy sequence closure cocones compact elements compiler Computer Science cone construction constructor expressions continuous CPO continuous lattice contraction coproduct corresponding countable CPO's declaration defined definition denotational semantics described diagram dl-domains domain equations EDHT-category embedding equivalence event structures example exists finite fixed point function space functor given graph hence ideal implies infinite initial algebra integers interpretation isomorphism Lawson topology Lemma logic mathematical metric space monoid morphism N-graded natural numbers natural transformations node nondeterministic notation object operations pair par-nd partial evaluation partial order paths Plotkin polymorphic poset powerdomain powerspace Pr(D probabilistic programming languages proof properties Proposition QMet quasi-uniformity quasimetric space refine relation result satisfies Scott topology semilattice sketch subcategory subset syntactic Theorem theory tree unique variables

### Popular passages

Page 584 - useful comments on an earlier version of this paper. I would also like to acknowledge