On Linear Information Systems
Logic in Computer Science
2010-04-08 v1 Programming Languages
Abstract
Scott's information systems provide a categorically equivalent, intensional description of Scott domains and continuous functions. Following a well established pattern in denotational semantics, we define a linear version of information systems, providing a model of intuitionistic linear logic (a new-Seely category), with a "set-theoretic" interpretation of exponentials that recovers Scott continuous functions via the co-Kleisli construction. From a domain theoretic point of view, linear information systems are equivalent to prime algebraic Scott domains, which in turn generalize prime algebraic lattices, already known to provide a model of classical linear logic.
Keywords
Cite
@article{arxiv.1003.5518,
title = {On Linear Information Systems},
author = {A. Bucciarelli and A. Carraro and T. Ehrhard and A. Salibra},
journal= {arXiv preprint arXiv:1003.5518},
year = {2010}
}