%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:18 +0100 GMT
%    
% Selection : Author: V_Santos-Costa
%




@InProceedings{Popov:1997,
      AUTHOR = {Popov, Konstantin},
      TITLE = {A Parallel Abstract Machine for the Thread-Based Concurrent Constraint Language Oz},
      YEAR = {1997},
      BOOKTITLE = {Workshop On Parallism and Implementation Technology for (Constraint) Logic Programming Languages},
      EDITOR = {de Castro Dutra, I. and Santos Costa, V. and Silva, F. and Pontelli, E. and Gupta, G.},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/Others/pamoz.ps.gz},
      ABSTRACT = {A parallel abstract machine for Oz PAMOz is presented in this paper. Oz is a thread-based concurrent constraint programming language with state. Oz is convenient for concurrent programming like modelling multi-agent systems, as well as for solving combinatoric problems. PAMOz models the execution of a sublanguage of Oz without its constraint solving facilities. PAMOz has been implemented in the parallel Oz system, which is derived from the sequential Oz system and inherits its optimizations. PAMOz is targeted to shared-memory multiprocessors. PAMOz executes Oz threads in parallel. PAMOz is derived from AMOz, a sequential abstract machine for Oz. There are two principal differences between PAMOz and AMOz: the architecture of the abstract machine, and the implementation of operations on stateful data. PAMOz can be conservatively extended for full Oz; there is an interface between PAMOz and its constraint solving extension.},
      ANNOTE = {COLIURL : Popov:1997:PAM.pdf Popov:1997:PAM.ps}
}

@InProceedings{Schulte:2000,
      AUTHOR = {Schulte, Christian},
      TITLE = {Programming Deep Concurrent Constraint Combinators},
      YEAR = {2000},
      BOOKTITLE = {Practical Aspects of Declarative Languages, Second International Workshop, PADL 2000, January 17-18},
      NUMBER = {1753},
      PAGES = {215-229},
      EDITOR = {Pontelli, E. and Santos Costa, V.},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Boston, Massachusetts, USA},
      PUBLISHER = {Springer},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/combinators.ps.gz},
      ABSTRACT = {Constraint combination methods are essential for a flexible constraint programming system. This paper presents deep concurrent constraint combinators based on computation spaces as combination mechanism. It introduces primitives and techniques needed to program constraint combinators from computation spaces. The paper applies computation spaces to a broad range of combinators: negation, generalized reification, disjunction, and implication. Even though computation spaces have been conceived in the context of Oz, they are mainly programming language independent. This point is stressed by discussing them here in the context of Standard ML with concurrency features.},
      ANNOTE = {COLIURL : Schulte:2000:PDC.pdf Schulte:2000:PDC.ps}
}