Mathematical foundations of programming language semantics : 3rd workshop, Tulane university, New Orleans, Louisiana, USA, April 8-10, 1987 : proceedings
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 Work...
שמור ב:
| מחבר תאגידי: | |
|---|---|
| מחברים אחרים: | , , |
| פורמט: | Livre numérique |
| שפה: | Anglais |
| יצא לאור: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| סדרה: | Lecture notes in computer science
298 |
| נושאים: | |
| גישה מקוונת: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| הערה: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Mathematical foundations of programming language semantics, 3rd workshop, Tulane university, New Orleans, Louisiana, USA, April 8-10, 1987, proceedings, ed. by M. Main, A. Melton, M. Mislove, D. Schmidt, 1988, Berlin, Springer, 1 vol. (VIII-637 p.), Lecture notes in computer science, 3-540-19020-1 • Mathematical Foundations of Programming Language Semantics, Texte imprimé, 9783662213537 |
תוכן הענינים:
- 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.