Results 1  10
of
46
The Oz Programming Model
 COMPUTER SCIENCE TODAY, LECTURE NOTES IN COMPUTER SCIENCE
, 1995
"... The Oz Programming Model (OPM) is a concurrent programming model subsuming higherorder functional and objectoriented programming as facets of a general model. This is particularly interesting for concurrent objectoriented programming, for which no comprehensive formal model existed until now. ..."
Abstract

Cited by 294 (10 self)
 Add to MetaCart
The Oz Programming Model (OPM) is a concurrent programming model subsuming higherorder functional and objectoriented programming as facets of a general model. This is particularly interesting for concurrent objectoriented programming, for which no comprehensive formal model existed until now. The model
Rewriting Logic as a Logical and Semantic Framework
, 1993
"... Rewriting logic [72] is proposed as a logical framework in which other logics can be represented, and as a semantic framework for the specification of languages and systems. Using concepts from the theory of general logics [70], representations of an object logic L in a framework logic F are und ..."
Abstract

Cited by 147 (52 self)
 Add to MetaCart
Rewriting logic [72] is proposed as a logical framework in which other logics can be represented, and as a semantic framework for the specification of languages and systems. Using concepts from the theory of general logics [70], representations of an object logic L in a framework logic F are understood as mappings L ! F that translate one logic into the other in a conservative way. The ease with which such maps can be defined for a number of quite different logics of interest, including equational logic, Horn logic with equality, linear logic, logics with quantifiers, and any sequent calculus presentation of a logic for a very general notion of "sequent," is discussed in detail. Using the fact that rewriting logic is reflective, it is often possible to reify inside rewriting logic itself a representation map L ! RWLogic for the finitely presentable theories of L. Such a reification takes the form of a map between the abstract data types representing the finitary theories of...
Practical Applications of Constraint Programming
 CONSTRAINTS
, 1996
"... Constraint programming is newly flowering in industry. Several companies have recently started up to exploit the technology, and the number of industrial applications is now growing very quickly. This survey will seek, by examples, ..."
Abstract

Cited by 105 (1 self)
 Add to MetaCart
Constraint programming is newly flowering in industry. Several companies have recently started up to exploit the technology, and the number of industrial applications is now growing very quickly. This survey will seek, by examples,
A Foundation for Higherorder Concurrent Constraint Programming
, 1994
"... We present the flcalculus, a computational calculus for higherorder concurrent programming. The calculus can elegantly express higherorder functions (both eager and lazy) and concurrent objects with encapsulated state and multiple inheritance. The primitives of the flcalculus are logic variables ..."
Abstract

Cited by 60 (13 self)
 Add to MetaCart
We present the flcalculus, a computational calculus for higherorder concurrent programming. The calculus can elegantly express higherorder functions (both eager and lazy) and concurrent objects with encapsulated state and multiple inheritance. The primitives of the flcalculus are logic variables, names, procedural abstraction, and cells. Cells provide a notion of state that is fully compatible with concurrency and constraints. Although it does not have a dedicated communication primitive, the flcalculus can elegantly express onetomany and manytoone communication. There is an interesting relationship between the flcalculus and the ßcalculus: The flcalculus is subsumed by a calculus obtained by extending the asynchronous and polyadic ßcalculus with logic variables. The flcalculus can be extended with primitives providing for constraintbased problem solving in the style of logic programming. A such extended flcalculus has the remarkable property that it combines firstor...
Oz Explorer: A Visual Constraint Programming Tool
, 1997
"... This paper describes the Oz Explorer and its implementation. The Explorer is a visual constraint programming tool intended to support the development of constraint programs. It uses the search tree of a constraint problem as its central metaphor. Exploration and visualization of the search tree ar ..."
Abstract

Cited by 53 (1 self)
 Add to MetaCart
This paper describes the Oz Explorer and its implementation. The Explorer is a visual constraint programming tool intended to support the development of constraint programs. It uses the search tree of a constraint problem as its central metaphor. Exploration and visualization of the search tree are userdriven and interactive. The constraints of any node in the tree are available firstclass: predefined or userdefined procedures can be used to display or analyze them. The Explorer is a fast and memory efficient tool intended for the development of realworld constraint programs. The Explorer is implemented in Oz using firstclass computation spaces. There is no fixed search strategy in Oz. Instead, firstclass computation spaces allow to program search engines. The Explorer is one particular example of a userguided search engine. The use of recomputation to trade space for time makes it possible to solve large realworld problems, which would use too much memory otherwise.
Programming Constraint Inference Engines
 Proceedings of the Third International Conference on Principles and Practice of Constraint Programming
, 1997
"... Existing constraint programming systems offer a fixed set of inference engines implementing search strategies such as single, all, and best solution search. This is unfortunate, since new engines cannot be integrated by the user. ..."
Abstract

Cited by 49 (6 self)
 Add to MetaCart
Existing constraint programming systems offer a fixed set of inference engines implementing search strategies such as single, all, and best solution search. This is unfortunate, since new engines cannot be integrated by the user.
Encapsulated Search for Higherorder Concurrent Constraint Programming
 Logic Programming: Proceedings of the 1994 International Symposium
, 1994
"... The paper presents an extension of the concurrent constraint model providing for higherorder programming, deep guards, and encapsulated search. The paper focuses on a higherorder combinator providing for encapsulated search. The search combinator spawns a local computation space and resolves remai ..."
Abstract

Cited by 47 (13 self)
 Add to MetaCart
The paper presents an extension of the concurrent constraint model providing for higherorder programming, deep guards, and encapsulated search. The paper focuses on a higherorder combinator providing for encapsulated search. The search combinator spawns a local computation space and resolves remaining choices by returning the alternatives as firstclass citizens. The search combinator allows to program different search strategies, including depthfirst, indeterministic one solution, demanddriven multiple solution, all solutions, and best solution (branch and bound) search. The described computation model is realized in Oz, a programming language and system under development at DFKI. Keywords Concurrent constraint programming, higherorder programming, encapsulated search, search strategies, Oz. 1 Introduction Oz [2, 3, 9, 8, 7, 1] is an attempt to create a highlevel concurrent programming language providing the problem solving capabilities of logic programming (i.e., constraints ...
Encapsulated Search and Constraint Programming in Oz
, 1994
"... Oz is an attempt to create a highlevel concurrent programming language providing the problem solving capabilities of logic programming (i.e., constraints and search). Its computation model can be seen as a rather radical extension of the concurrent constraint model providing for higherorder pro ..."
Abstract

Cited by 36 (16 self)
 Add to MetaCart
Oz is an attempt to create a highlevel concurrent programming language providing the problem solving capabilities of logic programming (i.e., constraints and search). Its computation model can be seen as a rather radical extension of the concurrent constraint model providing for higherorder programming, deep guards, state, and encapsulated search. This paper focuses on the most recent extension, a higherorder combinator providing for encapsulated search. The search combinator spawns a local computation space and resolves remaining choices by returning the alternatives as firstclass citizens. The search combinator allows to program different search strategies, including depthfirst, indeterministic one solution, demanddriven multiple solution, all solutions, and best solution (branch and bound) search. The paper also discusses the semantics of integer and finite domain constraints in a deep guard computation model.
Functional Nets
 IN PROC. EUROPEAN SYMPOSIUM ON PROGRAMMING, NUMBER 1782 IN LNCS
, 2000
"... Functional nets combine key ideas of functional programming and Petri nets to yield a simple and general programming notation. They ..."
Abstract

Cited by 34 (5 self)
 Add to MetaCart
Functional nets combine key ideas of functional programming and Petri nets to yield a simple and general programming notation. They
An Overview of the Design of Distributed Oz
, 1997
"... We present a design for a distributed programming system, Distributed Oz, that abstracts away the network. This means that all network operations are invoked implicitly by the system as an incidental result of using particular language constructs. However, since network operations are expensive, the ..."
Abstract

Cited by 29 (7 self)
 Add to MetaCart
We present a design for a distributed programming system, Distributed Oz, that abstracts away the network. This means that all network operations are invoked implicitly by the system as an incidental result of using particular language constructs. However, since network operations are expensive, the programmer must retain control over network communication patterns. This control is provided through the language constructs, which while retaining their centralized semantics, are extended with a distributed semantics. Distributed Oz is an extension of Oz, a concurrent stateaware language with ørstclass procedures. Distributed Oz extends Oz with just two concepts: mobility and asynchronous ordered communication. Mobility provides for truly mobile objects in a simple and clean way. Asynchronous ordered communication allows to conveniently build servers. These two concepts give the programmer control over network communications. We give scenarios to show how common distributed programming ...