Stable bistructure models of PCF (preliminary draft)

DOI10.1007/3-540-58338-6_66zbMATH Open1493.68064OpenAlexW1576805133MaRDI QIDQ5096876FDOQ5096876

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

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

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)

Cites Work

• Petri nets, event structures and domains. I
• LCF considered as a programming language
• Linear logic
• Title not available (Why is that?)
• Bistructures, bidomains and linear logic
• Localisation and interaction in one dimension
• Fully abstract models of typed \(\lambda\)-calculi
• Sequential algorithms on concrete data structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Full Abstraction and the Context Lemma

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)