Closure Operator Semantics for Concurrent Constraint Logic Programming
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Abstract
This paper develops a denotation and abstract model based on closure operators for concurrent constraint logic programming. The denotational semantics is built domain theoretically and not from the computation sequences. The denotational semantics is related to an operational semantics. The operational semantics distinguishes successful and unsuccessful computations and observes intermediate results of divergent computations. The paper extends to the indeterminate setting, previous work on functional languages with logic variables [9].
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1990-12
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1174
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report