Mathematical Foundations of Programming Language Semantics -

. .

Résumé :
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.

Sommaire:
A categorical treatment of polymorphic operations.- A categorical approach to realizability and polymorphic types.- Rule-based semantics for an extended lambda-calculus.- Semantics of block structured languages with pointers.- Assertional categories.- Kan extensions in effective semantics.- The versatile continuous order.- On the Smyth power domain.- The metric closure powerspace construction.- A powerdomain construction.- Closure properties of a probabilistic domain construction.- Quasi-uniformities: Reconciling domains with metric spaces.- Solving reflexive domain equations in a category of complete metric spaces.- Topological completeness in an ideal model for polymorphic types.- New results on hierarchies of domains.- Semantically based axiomatics.- Metric spaces as models for real-time concurrency.- dI-domains as a model of polymorphism.- Continuous auxiliary relations.- Computable one-to-one enumerations of effective domains.- Extended abstract of MIX: A self-applicable partial evaluator for experiments in compiler generation.- Semantics-based tools for a specification-support environment.- A treatment of languages with stages of evaluation.- Operational semantics and a distributed implementation of CSP.- The semantics of Miranda's algebraic types.- Path semantics.- The formal description of data types using sketches.- Initial algebra semantics and concurrency.- High-level semantics.- An action semantics of standard ML.- An algorithmic approach to p-adic integers.- The shuffle bialgebra.