Extensional and intensional semantics of bounded and unbounded nondeterminism
From MaRDI portal
Recommendations
Cites work
- A mathematical semantics for a nondeterministic typed lambda-calculus
- An Alternative Order for the Failures Model
- Bistable Biorders: A Sequential Domain Theory
- Bistructures, bidomains and linear logic
- Call-by-value Termination in the Untyped lambda-calculus
- Countable nondeterminism and random assignment
- Finitary PCF is not decidable
- Foundations of Software Science and Computation Structures
- Fully abstract models of typed \(\lambda\)-calculi
- Fully abstract semantics for observably sequential languages
- scientific article; zbMATH DE number 5173454 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 3594646 (Why is no real title available?)
- scientific article; zbMATH DE number 1223609 (Why is no real title available?)
- scientific article; zbMATH DE number 1259144 (Why is no real title available?)
- scientific article; zbMATH DE number 2061712 (Why is no real title available?)
- scientific article; zbMATH DE number 1497810 (Why is no real title available?)
- scientific article; zbMATH DE number 3806938 (Why is no real title available?)
- Infinite trace equivalence
- LCF considered as a programming language
- Locally Boolean domains
- Sequential algorithms on concrete data structures
- Unary PCF is decidable
- Unbounded Non-determinism in CSP
Cited in
(2)
This page was built for publication: Extensional and intensional semantics of bounded and unbounded nondeterminism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028431)
