Bjorn Freeman-Benson. Constraint Imperative Programming. Technical Report 91-07-02, University of Washington, Seattle, July 1991. (PhD Dissertation). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Over-Constrained Systems in CLP and CSP - Jampel (1996) (2 citations) (Correct)
....choice in this thesis is to assume that the programmer will implicitly do source level transformation, taking responsibility for resolving unusual situations such as those mentioned above. These issues have been addressed to some extent by Borning and Freeman Benson in their work on Kaleidoscope [27, 28]. There are also links between this issue and some work in non monotonic logic see e.g. Brewka [11] 3.5.4 Using ordinals instead of the lexicographic ordering At certain stages in this thesis, integers alone are not enough to order various items, such as valuations or subsets of a set of ....
Bjorn Freeman-Benson. Constraint Imperative Programming. Technical Report 91-07-02, University of Washington, Seattle, July 1991. (PhD Dissertation).
Keeping Things Consistent - Hosking, Mugridge, Amor (1995) (1 citation) (Correct)
....To provide a solution to this problem alternative techniques, such as those described in the next three sections, are needed 3. Snart and multi directional constraints Snart (Hosking et al., 1994) is an object oriented extension of Prolog with multi directional constraint propagation (Hill, 1993; Freeman Benson, 1991). The imperative features of Snart and Prolog provide generalpurpose facilities for procedural programming within an object oriented setting. This, for example, permits all user interface processing to be developed within the language, rather than having to use a separate language (as with Kea) ....
....already been compared to the automatic recalculation facilities of spreadsheets. The Garnet system (Myers, 1990) also implements 1 way constraints and has a more comprehensive approach to user interface development than does Kea. ThingLab (Borning, 1981) Rendezvous (Hill, 1993) and Kaleidoscope (Freeman Benson, 1991) are all ObjectOriented languages incorporating perturbation based multi directional constraints like Snart. However, none provide the degree of flexibility and control over constraint processing as does Snart. Much work has focussed on the multiple view consistency problem, with the MVC approach ....
Freeman-Benson, B, 1991. Constraint imperative programming, Tech. report 91-07-02, University of Washington.
Support for Constructing Environments with Multiple Views - Grundy, Hosking, Mugridge, .. (1996) (2 citations) (Correct)
....effect is that the roof top and base can change independently, with height automatically recalculated, but if the base is moved the top is also moved, keeping height constant. Directions and reasons provide a simpler disambiguation mechanism than hierarchical constraints as in Kaleidoscope [7]. Snart demons are used in PlanEntry to ensure a changed building component is re rendered. A demon is a procedure executed whenever the value of any of the Snart object attributes used in the demon is changed. In a conventional language, procedural code would be needed to handle this dependency ....
Freeman-Benson, B., "Constraint imperative programming," Technical Report, University of Washington, Seattle, 1991.
Kaleidoscope: A Constraint Imperative Programming Language - Lopez, Freeman-Benson.. (1994) (11 citations) Self-citation (Freeman-benson) (Correct)
....enforced by a widely distributed set of small code fragments a recipe for maintenance headaches. To address this problem, we proposed constraint imperative programming (CIP) an integration of two disparate paradigms: a standard object oriented imperative one, and a declarative constraint one (Freeman Benson 1991; FreemanBenson and Borning 1992a; Freeman Benson and Borning 1992b) Compare the two code fragments in Figure 4.1, which allow the user to drag the mercury of a thermometer up and down. The version on the left uses only standard imperative constructs. It requires the programmer to check whether ....
....Jr. 1980) Bertrand (Leler 1987) and Siri (Horn 1992a; Horn 1992b) Of these, Siri, another constraint imperative language, is the closest to Kaleidoscope. For discussions of related work beyond this brief mention, see (Borning, Freeman Benson, and Wilson 1992; Freeman Benson and Borning 1992b; Freeman Benson 1991). The first version of Kaleidoscope, Kaleidoscope 90, had a Smalltalk like syntax and served as a proof of concept for CIP. Its successor, Kaleidoscope 91, had several features lacking from Kaleidoscope 90: a conventional Algol like syntax, multi methods, and eager constraint solving semantics. ....
[Article contains additional citation context not shown here]
Freeman-Benson, B. (1991, July). Constraint Imperative Programming. Ph.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC