Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computer Science
  4. Computer Science Technical Reports
  5. A Category-Theoretic Semantics for Unbounded Indeterminacy

A Category-Theoretic Semantics for Unbounded Indeterminacy

File(s)
88-957.pdf (864.75 KB)
88-957.ps (227.69 KB)
Permanent Link(s)
https://hdl.handle.net/1813/6797
Collections
Computer Science Technical Reports
Author
Panangaden, Prakash
Russell, James R.
Abstract

In this paper we give a category-theoretic semantics for a simple imperative language featuring unbounded indeterminacy. This semantics satisfies the categorical analogues of continuity and has the meaning of while loops defined as co-limits of $\omega$-diagrams. Furthermore, it collapses via an abstraction function to a semantics that is fully abstract, and coincides with the operational semantics. The abstraction function is the only discontinuous function appearing in our semantics.

Date Issued
1988-12
Publisher
Cornell University
Keywords
computer science
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-957
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance