Nonwellfounded sets and programming language semantics
From MaRDI portal
Publication:6116571
Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- A calculus of communicating systems
- Comparative metric semantics for concurrent PROLOG
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- scientific article; zbMATH DE number 44058 (Why is no real title available?)
- Processes and the denotational semantics of concurrency
- Processes as terms: non-well-founded models for bisimulation
- Solving reflexive domain equations in a category of complete metric spaces
Cited in
(10)- A fixpoint approach to finite delay and fairness
- Co-induction in relational semantics
- Topology, domain theory and theoretical computer science
- Semantics for finite delay
- A nondeterministic well-founded semantics
- Processes as terms: non-well-founded models for bisimulation
- scientific article; zbMATH DE number 1107504 (Why is no real title available?)
- scientific article; zbMATH DE number 4193663 (Why is no real title available?)
- Language constructs for non-well-founded computation
- Logical foundations for programming semantics
This page was built for publication: Nonwellfounded sets and programming language semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6116571)
