scientific article; zbMATH DE number 194122
From MaRDI portal
Publication:4040912
zbMATH Open0702.68018MaRDI QIDQ4040912FDOQ4040912
Authors: Allen Stoughton 
Publication date: 5 June 1993
Title of this publication is not available (Why is that?)
Recommendations
- Fully abstract denotational models for nonuniform concurrent languages
- Formal models for some features of programming languages
- An algebraic model for programming languages
- An abstract compiler model as a result of the algebraic semantics of a programming language
- Approximation of abstract semantics by formal models of programs
- scientific article; zbMATH DE number 18655
- Abstract interpretation as a programming language
- A theoretical model of a high-level programming language
- scientific article; zbMATH DE number 4033047
- Fully abstract translations between functional languages
program correctnessprogram transformationprogram equivalenceDenotational semanticsfully abstract modelsleast fixed point models
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)
Cited In (36)
- The semantics of the combination of atomized statements and parallel choice
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A higher-order calculus of computational fields
- Semantical analysis of specification logic
- A categorical foundation for structured reversible flowchart languages: soundness and adequacy
- Concurrent testing of processes
- There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
- Full abstraction and limiting completeness in equational languages
- Title not available (Why is that?)
- Universal properties of impure programming languages
- A uniform approach to completions of posets
- Full abstraction for PCF
- Equationally fully abstract models of PCF
- Sequential functions on indexed domains and full abstraction for a sub-language of PCF
- On dynamically generated ontology translators in agent communication
- General conditions for full abstraction
- Fully abstract denotational models for nonuniform concurrent languages
- Infinite trace equivalence
- Infinite trace equivalence
- Fully abstract translations between functional languages
- A blocking model for reactive objects
- Types and full abstraction for polyadic \(\pi\)-calculus
- On a higher-order calculus of computational fields
- Formal models for some features of programming languages
- Full Abstraction for Reduced ML
- Title not available (Why is that?)
- Continuous functions and parallel algorithms on concrete data structures
- On abstraction and the expressive power of programming languages
- Full abstraction for Reduced ML
- From operational to denotational semantics
- Modelling local variables: possible worlds and object spaces
- A direct characterization of completion
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040912)
