Games and full abstraction for FPC.
type: Item
instance of: scholarly article
title: Games and full abstraction for FPC.
zbMATH Open document ID: 1046.68508
author: Guy McCusker
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68N18
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 03D65
Mathematics Subject Classification ID: 91A99
zbMATH DE Number: 1853109
MaRDI profile type: Publication
OpenAlex ID: W2650831125
cites work: Games and full completeness for multiplicative linear logic
cites work: Q4490717
cites work: Q4870803
cites work: Q4222822
cites work: Q4218919
cites work: Q4218922
cites work: Fully abstract semantics for observably sequential languages
cites work: Q5287527
cites work: I-categories as a framework for solving domain equations
cites work: Axiomatic Domain Theory in Categories of Partial Maps
cites work: Q3999206
cites work: Q3978971
cites work: Q3138538
cites work: Linear logic
cites work: Q4204146
cites work: Q4222760
cites work: Q4288818
cites work: On full abstraction for PCF: I, II and III
cites work: Game theoretic analysis of call-by-value computation
cites work: Games and Definability For FPC
cites work: Q4231031
cites work: Fully abstract models of typed \(\lambda\)-calculi
cites work: Q4501156
cites work: Kripke logical relations and PCF
cites work: Relational properties of domains
cites work: LCF considered as a programming language
cites work: Q3138548
cites work: The Category-Theoretic Solution of Recursive Domain Equations
cites work: Q3141916
DOI: 10.1006/INCO.1999.2845
description: scientific article; zbMATH DE number 1853109