Implementing Constraint Imperative Programming Languages: The Kaleidoscope'93 Virtual Machine (1994) [10 citations — 1 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Gus Lopez and Gus Lopez and Alan Borning and Alan Borning and Bjorn Freeman-benson and Bjorn Freeman-benson},
title = {Implementing Constraint Imperative Programming Languages: The Kaleidoscope'93 Virtual Machine},
year = {1994}
}
Bookmarks
OpenURL
Abstract:
. Constraint Imperative Programming (CIP) languages integrate declarative constraints with imperative state and destructive assignment, yielding a powerful new programming paradigm. However, CIP languages are difficult to implement efficiently due to complex interactions between the two donor paradigms. Neither the virtual machines for classical object-oriented languages, nor those for existing constraint languages, are suitable for implementing CIP languages, as each assumes a purely imperative or a purely declarative computation model. We have developed a new virtual machine for CIP languages, the K-machine, an imperative machine with an incremental constraint solver and a constraint-based, rather than value-based, data store. This virtual machine allows user-defined constraints to be defined using constraint constructor definitions which are the CIP analog to method definitions. Similar to methods, these constructors are able to reference variables indirectly through many levels of ...
