Stable bistructure models of PCF (preliminary draft)

DOI10.1007/3-540-58338-6_66MaRDI QIDQ5096876zbMATH OpenOpenAlexFDO

Authors Glynn Winskel

Publication date 18 August 2022

Published in Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58338-6_66

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic in computer science (03B70) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Categorical aspects of linear logic (18M45)

Recommendations

• Bistructures, bidomains and linear logic
• On Berry's conjectures about the stable order in PCF
• Bistable Biorders: A Sequential Domain Theory
• Computer Science Logic
• A stable programming language

Cites work

• scientific article; zbMATH DE number 1678365 (Why is no real title available?)
• scientific article; zbMATH DE number 3976319 (Why is no real title available?)
• scientific article; zbMATH DE number 4103051 (Why is no real title available?)
• scientific article; zbMATH DE number 234028 (Why is no real title available?)
• Bistructures, bidomains and linear logic
• Full Abstraction and the Context Lemma
• Fully abstract models of typed \(\lambda\)-calculi
• LCF considered as a programming language
• Linear logic
• Localisation and interaction in one dimension
• Petri nets, event structures and domains. I
• Sequential algorithms on concrete data structures

Cited in

(3)

• Bistable Biorders: A Sequential Domain Theory
• Computer Science Logic
• On Berry's conjectures about the stable order in PCF

This page was built for publication: Stable bistructure models of PCF (preliminary draft)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096876)