Mathematical Foundations of Programming Language Semantics: 3rd Workshop Tulane University, New Orleans, Louisiana, USA, April 8-10, 1987 Proceedings

by Michael G. Main (editor)

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.- 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 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.

652 pages, Paperback

First published April 15, 1988