Mathematical foundations of programming semantics : international conference, Manhattan, Kansas, April 11-12, 1985 : proceedings
Αποθηκεύτηκε σε:
| Συγγραφή απο Οργανισμό/Αρχή: | |
|---|---|
| Άλλοι συγγραφείς: | |
| Μορφή: | Livre numérique |
| Γλώσσα: | Anglais |
| Έκδοση: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Σειρά: | Lecture notes in computer science
239 |
| Θέματα: | |
| Διαθέσιμο Online: | 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 semantics, international conference, Manhattan, Kansas, April 11-12, 1985, proceedings, edited by Austin Melton, Berlin, Springer-Verlag, 1986, 1 vol. (VI-395 p.), Lecture notes in computer science, 0-387-16816-8 • Mathematical Foundation of Programming Semantics, Texte imprimé, 9783662180983 |
Πίνακας περιεχομένων:
- Standard, storeless semantics for ALGOL-style block structure and call-by-name
- Cartesian closed categories, quasitopoi and topological universes
- Concrete categories and injectivity
- Fixed points in process algebras with internal actions
- A fully abstract semantics and a proof system for an algol-like language with sharing
- Comparing categories of domains
- Galois connections
- Retracts of SFP objects
- Continuous categories
- Free constructions of powerdomains
- Additive domains
- A topological framework for cpos lacking bottom elements
- Detecting local finite breadth in continuous lattices and semilattices
- On the variety concept for ?-continuous algebras. Application of a general approach
- On denotational semantics of data bases
- Postconditional semantics of data base queries
- What is a model? A consumer's perspective on semantic theory
- Modal theory, partial orders, and digital geometry
- An FP domain with infinite objects
- Union complete countable subset systems
- On the syntax and semantics of concurrent computing.