(Enter summary)
Abstract: We present a calculus providing an abstract operational semantics for higherorder
concurrent constraint programming. The calculus is parameterized with
a first-order constraint system and provides first-class abstraction, guarded
disjunction, committed-choice, deep guards, dynamic creation of unique
names, and constraint communication. The calculus comes with a declarative
sublanguage for which computation amounts to equivalence transformation
of formulas. The declarative sublanguage can... (Update)
Context of citations to this paper: More
...constraints and search. Other aspects of the calculus, in particular deep guards and the relationship to logic programming, are discussed in [12]. The search combinator is introduced in [10, 11] Acknowledgements The following persons have contributed directly to the design and...
.... Our approach is based on abstract tree rewriting which appeared in a revised representation of the calculus [9] and was employed in [15, 16] to formulate calculi for higher order concurrent constraint programming model. The abstract tree rewriting model proves particularly...
Cited by: More
Adding Time via Timed Transitions to Concurrent.. - Brim, Kretinsky..
(Correct)
Constraint Programming for Natural Language Processing - Duchier (2000)
(Correct)
A Confluent Relational Calculus for Higher-Order Programming.. - Niehren, Smolka (1994)
(Correct)
Active bibliography (related documents): More All
0.9: A Calculus for Higher-order Concurrent Constraint Programming.. - Smolka (1994)
(Correct)
0.4: Programming Constraint Services - Schulte (2002)
(Correct)
0.3: A Foundation for Higher-order Concurrent Constraint Programming - Gert Smolka (1994)
(Correct)
Similar documents based on text: More All
3.7: Functional Computation in a Calculus of Relational.. - Joachim Niehren, Gert .. (1994)
(Correct)
3.6: Encapsulated Search and Constraint Programming in Oz - Schulte, Smolka, Würtz (1994)
(Correct)
3.4: An Abstract Machine for Oz - Mehl, al. (1995)
(Correct)
Related documents from co-citation: More All
13: A foundation for higher-order concurrent constraint programming
- Smolka - 1994
13: Concurrent Constraint Programming (context) - Saraswat - 1990
13: Object-Oriented Concurrent Constraint Programming in Oz
- Smolka, Henz et al. - 1993
BibTeX entry: (Update)
Gert Smolka. A calculus for higher-order concurrent constraint programming. Research report, DFKI, Saarbrucken, Germany, 1993. Forthcoming. http://citeseer.ist.psu.edu/smolka94calculus.html More
@techreport{ smolka94calculus,
author = "Gert Smolka",
title = "A Calculus for Higher-Order Concurrent Constraint Programming with Deep Guards",
number = "RR-94-03",
address = "Deutsches Forschungszentrum f{\"u}r K{\"u}nstliche Intelligenz GmbH\\Erwin-Schr{\"o}dinger Stra{ss}e\\Postfach 2080\\67608 Kaiserslautern\\Germany",
pages = "34",
year = "1994",
url = "citeseer.ist.psu.edu/smolka94calculus.html" }
Citations (may not include all citations):
1838
Foundations of Logic Programming (context) - Lloyd - 1987
854
Information and Computation (context) - Milner, Parrow et al. - 1992
788
Rewrite systems
- Dershowitz, Jouannaud - 1990
344
Concurrent constraint programming (context) - Saraswat, Rinard - 1990
247
The family of concurrent logic programming languages (context) - Shapiro - 1989
221
Constraint logic programming (context) - Jaffar, Lassez - 1987
166
An overview of Prolog (context) - Nadathur, Miller - 1988
151
Logic semantics for a class of committed-choice programs (context) - Maher - 1987
121
Concurrent Constraint Programming Languages (context) - Saraswat - 1989
118
Complete axiomatizations of the algebras of finite (context) - Maher - 1988
114
Programming paradigms of the Andorra kernel language
- Janson, Haridi - 1991
106
the observable properties of higher order functions that dyn..
- Pitts, Stark - 1993
105
Records for logic programming
- Smolka, Treinen - 1992
101
Hilog: A foundation for higher-order logic programming
- Chen, Kifer et al. - 1993
75
Object-oriented concurrent constraint programming in Oz
- Smolka, Henz et al. - 1993
72
Kernel Andorra Prolog and its computation model
- Haridi, Janson - 1990
57
A logic programming view of CLP
- Maher - 1993
52
The chemical abstract machine (context) - Berry, Boudol - 1990
36
Oz---a programming language for multi-agent systems
- Henz, Smolka et al. - 1993
34
The category of constraint systems is Cartesian-closed (context) - Saraswat - 1992
32
Constraint Logic Programming: Selected Research (context) - Benhamou, Colmerauer - 1993
27
Residuation and guarded rules for constraint logic programmi..
- Smolka - 1993
25
A relational language for parallel programming (context) - Clark, Gregory - 1981
25
Negation and quantifiers in NU-Prolog (context) - Naish - 1986
19
Technology and Science of Informatics (context) - Colmerauer, Kanoui et al. - 1983
16
the treatment of cuts in Prolog source-level tools (context) - O'Keefe - 1985
11
A feature-based constraint system for logic programming with..
- Ait-Kaci, Podelski et al. - 1994
10
Deutsches Forschungszentrum fur Kunstliche Intelligenz (context) - Henz, Mehl et al. - 1994
8
A process algebra of concurrent constraint programming (context) - de Boer, Palamidessi - 1992
8
Structural operational semantics for AKL
- Haridi, Janson et al. - 1992
6
and Seif Haridi (context) - Janson, Montelius - 1993
5
Functional computation in a calculus of relational abstracti..
- Niehren, Smolka - 1994
1
and Kim Marriott (context) - Lassez, Maher - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ps.uni-sb.de/Papers/abstracts/): More
Set-Based Failure Analysis for Logic Programs and.. - Podelski, Charatonik, .. (1999)
(Correct)
Type Inference for First-Class Messages with Feature Constraints - Müller, Nishimura
(Correct)
Entailment of Non-Structural Subtype Constraints - Niehren, Priesnitz (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC