Observable sequentiality and full abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fully abstract semantics for observably sequential languages
Information and Computation
Information and Computation
Games on Graphs and Sequentially Realizable Functionals
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
On the Symmetry of Sequentiality
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Some Programming Languages Suggested by Game Models (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Nondeterminism and observable sequentiality
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Universality results for models in locally boolean domains
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
The elimination of nesting in SPCF
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
| Hi-index | 0.00 |
Bistable bidomains have been used to give a simple order-theoretic construction of a cartesian closed category of sequential functions. In this paper, we investigate the intensional properties of a full subcategory, the locally boolean domains, in which the bistable structure is given by an involution operation. We show that every pointed locally boolean domain is the limit of an ω-chain of "prenex normal forms" constructed using only products and lifted sums. We use this result to describe a model of linear logic (incorporating both intuitionistic and polarized classical fragments). We show that affine and bistable functions correspond to unique "strategies" on the associated normal forms, and that function composition corresponds to "parallel composition plus hiding" of these strategies.