Stable bistructure models of PCF

DOI10.1007/3-540-58338-6_66zbMath1493.68064OpenAlexW1576805133MaRDI QIDQ5096876

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) Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Categorical aspects of linear logic (18M45)

Cites Work

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

This page was built for publication: Stable bistructure models of PCF