检索结果-内蒙古大学图书馆

15th International Conference on Modularity (MODULARITY)

作者： Hosobe, Hiroshi Hosei Univ Tokyo Japan

ISBN: (纸本)9781450340335

To construct interactive graphics such as graphical user interfaces and interactive webpages is an important matter in computer programming. For this purpose, imperative programming usually has been used. On the other hand, researchers have been attempting to apply constraint programming to interactive graphics. Furthermore, the paradigm of constraint imperative programming has been proposed. This position paper reports our ongoing work on P5CP, a new constraint imperative programming language for interactive graphics. To integrate imperative and constraint programming, we adopt the notion of events in imperative programming and the notion of guards in concurrent constraint programming. We show a simple example program in this language.

关键词： constraint imperative programming programming languages Interactive graphics

来源：评论

学校读者我要写书评

暂无评论

Implementing constraint imperative programming languages: the Kaleidoscope'93 virtual machine 94

Implementing constraint imperative programming languages: th...

引用

Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications

作者： Gus Lopez Bjorn Freeman-Benson Alan Borning Dept. of Computer Science & Engineering FR-35 University of Washington Seattle WA School of Computer Science Carleton University 1125 Colonel By Drive Ottawa Ontario Canada K1S 5B6

ISBN: (纸本)9780897916882

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 pointers. The K-machine maintains relations between objects in the presence of state change to these indirectly referenced objects. The K-machine is capable of supporting a wide variety of CIP languages, including our most recent: Kaleidoscope'93.

关键词： constraints constraint imperative programming incremental constraint solving virtual machines

来源：评论

学校读者我要写书评

暂无评论

Automatically Selecting and Optimizing constraint Solver Procedures for Object-constraint Languages 2016

Automatically Selecting and Optimizing Constraint Solver Pro...

引用

15th International Conference on Modularity (MODULARITY)

作者： Felgentreff, Tim Lehmann, Stefan Hirschfeld, Robert Gerstenberg, Sebastian Reschke, Jakob Rueckert, Lars Siegler, Patrick Graichen, Jan Nicolai, Christian Swart, Malte Univ Potsdam Hasso Plattner Inst Potsdam Germany

ISBN: (纸本)9781450340335

Object-constraint programming provides a design to integrate constraints with dynamic, object-oriented programming languages. It allows developers to encode multi-way constraints over objects and object collections using existing, object-oriented abstractions. These constraints are automatically maintained at run-time. One original goal of the Babelsberg-family of object-constraint programming languages was to allow users familiar with the imperative paradigm to quickly and efficiently make use of constraint solver capabilities. Yet, practical problems often require careful selection of solvers to find good solutions (or any at all). Furthermore, solver performance can vary and while most solvers come with various optimizations, developers have to have a good understanding of the solving process to use these optimizations effectively. This, however, is difficult to achieve if the solver is automatically selected by the system. In this work, we discuss three different implementations for automatic solver selection that we used in Babelsberg implementations. As a second step, we look at the performance potential of edit constraints that are available in some solvers such as Cassowary or DeltaBlue, and how they can be applied automatically to improve solver performance. We argue that these techniques make object constraint programming more practical by improving the quality and performance of solutions.

关键词： constraints Incremental Re-solving Object constraint programming constraint imperative programming Babelsberg

来源：评论

学校读者我要写书评

暂无评论

Checks and Balances constraint Solving without Surprises in Object-constraint programming Languages 2015

Checks and Balances Constraint Solving without Surprises in ...

引用

ACM SIGPLAN International Conference on Object-Oriented programming, Systems, Languages, and Applications (OOPSLA)

作者： Felgentreff, Tim Millstein, Todd Borning, Alan Hirschfeld, Robert Viewpoints Res Inst CDG SAP Labs Potsdam Germany Hasso Plattner Inst Potsdam Germany Univ Calif Los Angeles Los Angeles CA USA Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9781450336895

Object-constraint programming systems integrate declarative constraint solving with imperative, object-oriented languages, seamlessly providing the power of both paradigms. However, experience with object-constraint systems has shown that giving too much power to the constraint solver opens up the potential for solutions that are surprising and unintended as well as for complex interactions between constraints and imperative code. On the other hand, systems that overly limit the power of the solver, for example by disallowing constraints involving mutable objects, object identity, or polymorphic message sends, run the risk of excluding the core object-oriented features of the language from the constraint part, and consequently not being able to express declaratively a large set of interesting problem solutions. In this paper we present design principles that tame the power of the constraint solver in object-constraint languages to avoid difficult corner cases and surprising solutions while retaining the key features of the approach, including constraints over mutable objects, constraints involving object identity, and constraints on the results of message sends. We present our solution concretely in the context of the Babelsberg object-constraint language framework, providing both an informal description of the resulting language and a formal semantics for a core subset of it. We validate the utility of this semantics with an executable version that allows us to run test programs and to verify that they provide the same results as existing implementations of Babelsberg in JavaScript, Ruby, and Smalltalk.

关键词： constraints Object-constraint programming constraint imperative programming Executable Semantics Test Suites

来源：评论

学校读者我要写书评

暂无评论

Checks and Balances constraint Solving without Surprises in Object-constraint programming Languages

引用

ACM SIGPLAN NOTICES 2015年第10期50卷 767-782页

关键词： constraints Object-constraint programming constraint imperative programming Executable Semantics Test Suites

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：