See this document in CiteSeerX!

The Definition of Kernel Oz (1994)  (Make Corrections)  (28 citations)
Gert Smolka



  Home/Search   Context   Related

 
View or download:
ps.unisb.de/Papers/abstr...RR9423.ps
Cached:  PS.gz  PS   PDF  Image  Update  Help

From:  ps.unisb.de/Papers/abstracts/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Oz is a concurrent language providing for functional, object-oriented, and constraint programming. This paper defines Kernel Oz, a semantically complete sublanguage of Oz. It was an important design requirement that Oz be definable by reduction to a lean kernel language. (Update)

Context of citations to this paper:   More

...prune the search space in an efficient way. 2 Computation in Oz 2. 1 Computation Model The central notion in Oz is a computation space [14]. A computation space consists essentially of a constraint store and a set of associated tasks. Constraints residing in the constraint...

...generalize tuples in that subtrees can be referred to by name rather than by position only. Information on the universe can be found in [136]. More on records can be found in [140, 7] Finite Set Constraints In addition to finite domain constraints, full Oz offers constraints...

Cited by:   More
Logic Programming in the Context of Multiparadigm.. - Van Roy, Brand.. (2002)   (Correct)
A Type is a Type is a Type - Müller, Niehren (1995)   (Correct)
An Abstract Machine for Oz - Mehl, al. (1995)   (Correct)

Active bibliography (related documents):   More   All
0.9:   The Definition of Kernel Oz - Smolka (1994)   (Correct)
0.3:   A Survey of Oz - Smolka (1995)   (Correct)
0.2:   Ordering Constraints over Feature Trees - Müller, Niehren (1999)   (Correct)

Similar documents based on text:   More   All
3.9:   Encapsulated Search and Constraint Programming in Oz - Schulte, Smolka, Würtz (1994)   (Correct)
3.8:   A Complete and Recursive Feature Theory - Backofen, Smolka (1992)   (Correct)
3.7:   Inheritance and Complementation: A Case Study of Easy.. - Flickinger, Nerbonne (1991)   (Correct)

Related documents from co-citation:   More   All
16:   The Oz programming model - Smolka - 1995
15:   Object-Oriented Concurrent Constraint Programming in Oz - Smolka, Henz et al. - 1993
13:   Encapsulated search in higher-order concurrent constraint programming - Schulte, Smolka - 1994

BibTeX entry:   (Update)

G. Smolka. The definition of Kernel Oz. In A. Podelski, editor, Constraints: Basics and Trends, pages 251--292. Lecture Notes in Computer Science, Vol. 910, SpringerVerlag, Berlin, 1995. http://citeseer.ist.psu.edu/smolka94definition.html   More

@techreport{ smolka94definition,
    author = "Gert Smolka",
    title = "The Definition of Kernel Oz",
    number = "RR-94-23",
    address = "Deutsches Forschungszentrum f{\"u}r K{\"u}nstliche Intelligenz GmbH\\Erwin-Schr{\"o}dinger Stra{ss}e\\Postfach 2080\\67608 Kaiserslautern\\Germany",
    pages = "53",
    year = "1994",
    url = "citeseer.ist.psu.edu/smolka94definition.html" }
Citations (may not include all citations):
200   Viewing control structures as patterns of passing messages (context) - Hewitt - 1977  DBLP
194   Functions as processes (context) - Milner - 1992  ACM   DBLP
137   Laboratory for Foundations of Computer Science (context) - Milner, -calculus et al. - 1991
105   Records for logic programming - Smolka, Treinen - 1994  DBLP
63   German Research Center for Artificial Intelligence (context) - Smolka, primer et al. - 1994
48   Encapsulated search in higher-order concurrent constraint pr.. - Schulte, Smolka - 1994
45   German Research Center for Artificial Intelligence (context) - Henz, Muller et al. - 1994
45   German Research Center for Artificial Intelligence (context) - Henz, notation et al. - 1994
41   A foundation for higher-order concurrent constraint programm.. - Smolka - 1994
39   A calculus for higher-order concurrent constraint programmin.. - Smolka - 1994
37   Encapsulated search and constraint programming in Oz - Schulte, Smolka et al. - 1994  ACM   DBLP
17   German Research Center for Artificial Intelligence (context) - Muller, Popow et al. - 1994
16   Feature constraints with first-class features - Treinen - 1993
11   How to win a game with features - Backofen, Treinen - 1994  ACM   DBLP
11   A feature-based constraint system for logic programming with.. - Ait-Kaci, Podelski et al. - 1994
2   a preliminary version is available as DFKI Research Report R.. (context) - Backofen, Smolka et al. - 1995



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