scientific article; zbMATH DE number 194122
From MaRDI portal
Publication:4040912
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
Cited in
(37)- From operational to denotational semantics
- The semantics of the combination of atomized statements and parallel choice
- scientific article; zbMATH DE number 821282 (Why is no real title available?)
- scientific article; zbMATH DE number 1531369 (Why is no real title available?)
- scientific article; zbMATH DE number 1549510 (Why is no real title available?)
- scientific article; zbMATH DE number 3976319 (Why is no real title available?)
- scientific article; zbMATH DE number 3938561 (Why is no real title available?)
- Semantical analysis of specification logic
- A higher-order calculus of computational fields
- 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
- From operational semantics to domain theory
- Full abstraction and limiting completeness in equational languages
- scientific article; zbMATH DE number 2061712 (Why is no real title available?)
- Universal properties of impure programming languages
- Full abstraction for PCF
- A uniform approach to completions of posets
- On dynamically generated ontology translators in agent communication
- Equationally fully abstract models of PCF
- Sequential functions on indexed domains and full abstraction for a sub-language of PCF
- General conditions for full abstraction
- Fully abstract denotational models for nonuniform concurrent languages
- Infinite trace equivalence
- Infinite trace equivalence
- A blocking model for reactive objects
- Fully abstract translations between functional languages
- Types and full abstraction for polyadic \(\pi\)-calculus
- On a higher-order calculus of computational fields
- Formal models for some features of programming languages
- scientific article; zbMATH DE number 18655 (Why is no real title available?)
- Full Abstraction for Reduced ML
- On abstraction and the expressive power of programming languages
- Continuous functions and parallel algorithms on concrete data structures
- Full abstraction for Reduced ML
- A direct characterization of completion
- Modelling local variables: possible worlds and object spaces
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)
