Abstract semantics for functional constraint programming

Update item information
Publication Type technical report
School or College College of Engineering
Department Computing, School of
Creator Lindstrom, Gary E.
Other Author Mantha, Surya; George, Lal
Title Abstract semantics for functional constraint programming
Date 1989
Description A denotational semantics is given for a lazy functional language with monotonic side-effects arising from the unification of singly-bound logical variables. The semantics is based on a Scott-style information system, which elegantly captures the notion of "constraint additin" inherent in unification. A novel feature of our approach is exploitation of the representational duality of denotations defined by information systems: (i) as domain elements in the traditional sense, and (ii) as sets of propositions or constraints. Spread care is taken to express accurately the interactions of lazy evaluation (e.g. evaluation by need), and read-only accesses of logical variables defer function applications. The purpose of our semantic description is to establish language properties such as determinacy under parallel evaluation, to validate implementation strategies, and to support the design of program analysis techniques such as those based on abstract interpretation.
Type Text
Publisher University of Utah
Subject Abstract semantics
Subject LCSH Semantic integration (Computer systems); Constraint programming (Computer science)
Language eng
Bibliographic Citation Mantha, S., George, L., & Lindstrom, G. E. (1989). Abstract semantics for functional constraint programming. 1-15. UUCS-89-022.
Series University of Utah Computer Science Technical Report
Relation is Part of ARPANET
Rights Management ©University of Utah
Format Medium application/pdf
Format Extent 3,204,477 bytes
Identifier ir-main,16177
ARK ark:/87278/s6df78jv
Setname ir_uspace
Date Created 2012-06-13
Date Modified 2015-04-22
ID 704682
Reference URL https://collections.lib.utah.edu/ark:/87278/s6df78jv
Back to Search Results