• Locally Boolean domains

Result: Locally Boolean domains

Title:
Locally Boolean domains
Authors:
LAIRD, J
Source:
Applied Semantics: Selected TopicsTheoretical computer science. 342(1):132-148
Publisher Information:
Amsterdam: Elsevier, 2005.
Publication Year:
2005
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Logique mathématique, fondements, théorie des ensembles, Mathematical logic, foundations, set theory, Logique et fondements, Logic and foundations, Logique générale, General logic, Algèbre, Algebra, Catégories, algèbre homologique, Category theory, homological algebra, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Catégorie fermée cartésienne, Cartesian closed category, Categoría cerrada cartesiana, Forme normale, Normal form, Forma normal, Informatique théorique, Computer theory, Informática teórica, Logique intuitionniste, Intuitionistic logic, Lógica intuicionista, Logique linéaire, Linear logic, Lógica lineal, Modèle logique, Logic model, Modelo lógico, Méthode séquentielle, Sequential method, Método secuencial, Catégorie cartésienne fermée, Composition parallèle, Sémantique jeu, Game semantics, Théorie domaine, Domain theory
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Informatics, University of Sussex, United Kingdom
ISSN:
0304-3975
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17042595
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Mathematics
Accession Number:
edscal.17042595
Database:
PASCAL Archive

Further Information

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 stuns. 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.