Semantics : foundations and applications : REX Workshop, Beekbergen, the Netherlands, June 1-4, 1992 : proceedings
Researchers working on the semantics of programming languages came together in The Netherlands in June 1992 for a workshop on Semantics - Foundations and Applications. This volume is based on the meeting and contains material prepared by the lecturers after the meeting took place. The volume include...
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
666 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Semantics, foundations and applications, REX Workshop, Beekbergen, the Netherlands, June 1-4, 1992, proceedings, J.W. de Baker, W.P. de Roever, G. Rozenberg, eds, Berlin, Springer-Verlag, 1993, 1 vol. (VIII-659 p.), Lecture notes in computer science, 3-540-56596-5 • Semantics: Foundations and Applications, Texte imprimé, 9783662209080 |
Indholdsfortegnelse:
- Predicate transformers and higher order logic
- Trace Nets
- Proving total correctness of programs in weak second-order logic
- On blocks: locality and asynchronous communication
- Semantics, orderings and recursion in the weakest precondition calculus
- A categorical model for logic programs: Indexed monoidal categories
- A categorical view of process refinement
- Compact metric information systems
- Asynchronous rendez-vous in distributed logic programming
- New semantic tools for logic programming
- Temporal preconditions of recursive procedures
- Towards an epistemic approach to reasoning about concurrent programs
- A fully abstract model for a nonuniform concurrent language with parameterization and locality
- SPCF: its model, calculus, and computational power
- Infinite behaviour and fairness in concurrent constraint programming
- Full abstraction and unnested recursion
- On the action semantics of concurrent programming languages
- Layered predicates
- A hyperdoctrinal view of concurrent constraint programming
- On the foundations of final semantics: Non-standard sets, metric spaces, partial orders
- Infinite systems of equations over inverse limits and infinite synchronous concurrent algorithms
- Some issues in the semantics of facile distributed programming
- On the relation between unity properties and sequences of states
- Expressiveness results for process algebras
- Compiling joy into Silicon: An exercise in applied structural operational semantics.