A Cartesian Closed Category of Parallel Algorithms between Scott Domains

A Cartesian Closed Category of Parallel Algorithms between Scott Domains (1991)

Cached

Download Links

[reports.adm.cs.cmu.edu]

by Stephen Brookes , Shai Geva

Citations:

6 - 2 self

Versions

Version History

Metadata Version 3

User correction supplied by mph

Datum	Value	Source
TITLE	A Cartesian Closed Category of Parallel Algorithms between Scott Domains	user correction - Legacy Corrections
AUTHOR NAME	Stephen Brookes	user correction
AUTHOR AFFIL	School of Computer Science; Carnegie Mellon University	user correction
AUTHOR ADDR	Pittsburgh, PA 15213	user correction
AUTHOR NAME	Shai Geva	user correction
AUTHOR AFFIL	School of Computer Science; Carnegie Mellon University	user correction
AUTHOR ADDR	Pittsburgh, PA 15213	user correction
ABSTRACT	We present a category-theoretic framework for providing intensional semantics of programming languages and establishing connections between semantics given at different levels of intensional detail. We use a comonad to model an abstract notion of computation, and we obtain an intensional category from an extensional category by the co-Kleisli construction; thus, while an extensional morphism can be viewed as a function from values to values, an intensional morphism is akin to a function from computations to values. We state a simple category-theoretic result about cartesian closure. We then explore the particular example obtained by taking the extensional category to be Cont, the category of Scott domains with continuous functions as morphisms, with a computation represented as a non-decreasing sequence of values. We refer to morphisms in the resulting intensional category as algorithms. We show that the category Alg of Scott domains with algorithms as morphisms is cartesian closed. We...	user correction - Legacy Corrections
YEAR	1991	user correction - Legacy Corrections
CITATIONS	15 found	ParsCit 1.0