eCommons

 

Closure Operator Semantics for Concurrent Constraint Logic Programming

dc.contributor.authorJagadeesan, Radhakrishnanen_US
dc.contributor.authorShanbhogue, Vasanten_US
dc.date.accessioned2007-04-23T17:51:02Z
dc.date.available2007-04-23T17:51:02Z
dc.date.issued1990-12en_US
dc.description.abstractThis 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].en_US
dc.format.extent3877914 bytes
dc.format.extent725763 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1174en_US
dc.identifier.urihttps://hdl.handle.net/1813/7014
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleClosure Operator Semantics for Concurrent Constraint Logic Programmingen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
90-1174.pdf
Size:
3.7 MB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
90-1174.ps
Size:
708.75 KB
Format:
Postscript Files