scientific article; zbMATH DE number 7471671

MaRDI QIDQ5028431

James Laird

Publication date: 9 February 2022

Full work available at URL: https://arxiv.org/abs/1710.10203

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

denotational semanticsnondeterminismbiorderssequential algorithms

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A mathematical semantics for a nondeterministic typed lambda-calculus
• Sequential algorithms on concrete data structures
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• Unary PCF is decidable
• Fully abstract semantics for observably sequential languages
• Infinite trace equivalence
• Locally Boolean domains
• Call-by-value Termination in the Untyped lambda-calculus
• Countable nondeterminism and random assignment
• Unbounded Non-determinism in CSP
• Bistructures, bidomains and linear logic
• An Alternative Order for the Failures Model
• Bistable Biorders: A Sequential Domain Theory
• Foundations of Software Science and Computation Structures
• Finitary PCF is not decidable

This page was built for publication: