Results 1 
8 of
8
Solving Binary CSP Using Computational Systems
 Proc. First Intl. Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science
, 1996
"... In this paper we formalise CSP solving as an inference process. Based on the notion of Computational Systems we associate actions with rewriting rules and control with strategies that establish the order of application of the inferences. The main contribution of this work is to lead the way to the d ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
In this paper we formalise CSP solving as an inference process. Based on the notion of Computational Systems we associate actions with rewriting rules and control with strategies that establish the order of application of the inferences. The main contribution of this work is to lead the way to the design of a formalism allowing to better understand constraint solving and to apply in the domain of CSP the knowledge already developed in Automated Deduction. Keywords: Constraint Satisfaction Problems, Computational Systems, Rewriting Logic. 1 Introduction In the last twenty years many work has been done on solving Constraint Satisfaction Problems, CSP. The solvers used by constraint solving systems can be seen as encapsulated in black boxes. In this work we formalise CSP solving as an inference process. We are interested in description of constraint solving using rulebased algorithms because of the explicit distinction made in this approach between deduction rules and control. We associ...
The HOL Light manual (1.1)
, 2000
"... ion is in a precise sense a converse operation to application. Given 49 50 CHAPTER 5. PRIMITIVE BASIS OF HOL LIGHT a variable x and a term t, which may or may not contain x, one can construct the socalled lambdaabstraction x: t, which means `the function of x that yields t'. (In HOL's A ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
ion is in a precise sense a converse operation to application. Given 49 50 CHAPTER 5. PRIMITIVE BASIS OF HOL LIGHT a variable x and a term t, which may or may not contain x, one can construct the socalled lambdaabstraction x: t, which means `the function of x that yields t'. (In HOL's ASCII concrete syntax the backslash is used, e.g. \x. t.) For example, x: x + 1 is the function that adds one to its argument. Abstractions are not often seen in informal mathematics, but they have at least two merits. First, they allow one to write anonymous functionvalued expressions without naming them (occasionally one sees x 7! t[x] used for this purpose), and since our logic is avowedly higher order, it's desirable to place functions on an equal footing with rstorder objects in this way. Secondly, they make variable dependencies and binding explicit; by contrast in informal mathematics one often writes f(x) in situations where one really means x: f(x). We should give some idea of how ordina...
The HOL Light manual (1.0)
, 1998
"... ion is in a precise sense a converse operation to application. Given 49 50 CHAPTER 5. PRIMITIVE BASIS OF HOL LIGHT a variable x and a term t, which may or may not contain x, one can construct the socalled lambdaabstraction x: t, which means `the function of x that yields t'. (In HOL's A ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
ion is in a precise sense a converse operation to application. Given 49 50 CHAPTER 5. PRIMITIVE BASIS OF HOL LIGHT a variable x and a term t, which may or may not contain x, one can construct the socalled lambdaabstraction x: t, which means `the function of x that yields t'. (In HOL's ASCII concrete syntax the backslash is used, e.g. "x. t.) For example, x: x + 1 is the function that adds one to its argument. Abstractions are not often seen in informal mathematics, but they have at least two merits. First, they allow one to write anonymous functionvalued expressions without naming them (occasionally one sees x 7! t[x] used for this purpose), and since our logic is avowedly higher order, it's desirable to place functions on an equal footing with firstorder objects in this way. Secondly, they make variable dependencies and binding explicit; by contrast in informal mathematics one often writes f(x) in situations where one really means x: f(x). We should give some idea of how ordinary...
A DISTRIBUTED SYSTEMS LANGUAGE
, 1985
"... In a distributed environment, processes interact solely through the ii the SODA distributed operating system was in some ways considerably simpler, The Charlotte implementation is complete and performs well. iii exchange of messages. Safe, convenient, and emcient communication is of vital importance ..."
Abstract
 Add to MetaCart
In a distributed environment, processes interact solely through the ii the SODA distributed operating system was in some ways considerably simpler, The Charlotte implementation is complete and performs well. iii exchange of messages. Safe, convenient, and emcient communication is of vital importance, not only for th\! tightlycoupled components of parallel algorithms, hut also for more looselycoupled us\!rs '01 ' distrihuwd resources. Server processes in particular must b\! ablt to communicate effectively with clients written at widely varying times and displaying largely unpredictable behavior. Such communication requires highlevel language support. Interprocess communication can be supported by augmenting a conventional sequential language with direct calls to operating system primitives, but the result is both cumbersome and dangerous. Convenience and safety are offered by the many distributed languages proposed to date, but in a form too innexible
Computer Controlled Mechanical Assembly
"... Abstract: This paper describes an experimental very high level programming system for computer controlled mechanical assembly. AUTOPASS (AuTomated Parts Assembly System). The AUTOPASS language is oriented towards objects and assembly operations, rather than motions of mechanical assembly machines. I ..."
Abstract
 Add to MetaCart
Abstract: This paper describes an experimental very high level programming system for computer controlled mechanical assembly. AUTOPASS (AuTomated Parts Assembly System). The AUTOPASS language is oriented towards objects and assembly operations, rather than motions of mechanical assembly machines. It is intended to enable the user to concentrate on overall the assembly sequence and to program with Englishlike statements using names and terminology that are familiar to him. To relate assembly operations to manipulator motions, the AUTOPASS compiler uses an internal representation of the assembly world. This representation consists of a geometric data base generated prior to compilation and updated during compilation; it thus represents the state of the world at each assembly step. The level of the language has been chosen to provide a high degree of assistance to the user without the systemâ€™s having to perform artificial intelligence type problem solving operations.
Reports and Articles Beyond Programming Languages
"... ability to create large systems is leading to basic changes in the nature of programming. Current programming language concepts will not be adequate for building and maintaining systems of the complexity called for by the tasks we attempt. Just as high level languages enabled the programmer to escap ..."
Abstract
 Add to MetaCart
ability to create large systems is leading to basic changes in the nature of programming. Current programming language concepts will not be adequate for building and maintaining systems of the complexity called for by the tasks we attempt. Just as high level languages enabled the programmer to escape from the intricacies of a machine's order code, higher level programming systems can provide the means to understand and manipulate complex systems and components. In order to develop such systems, we need to shift our attention away from the detailed specification of algorithms, towards the description of the properties of the packages and objects with which we build. This paper analyzes some of the shortcomings of programming languages as they now exist, and lays out some possible directions for future research.