(Enter summary)
Abstract: Automatic memory management and the hiding of the notion
of pointers are the prominent features of symbolic processing languages. (Update)
Context of citations to this paper: More
.... depend on a combination of special language constructs and analysis [17, 1, 21] others are solely based on compiler analyses [7, 11, 20]. At least in logic programming, none of the analysis based methods has reached the maturity of becoming part of a widely distributed...
.... At the same time, by using a linearity system, we can guarantee that only one process holds a read capability of a logical variable [46], in which case ask can destroy a message it has received, as will be discussed in detail in this paper. One feature of constraint based...
Cited by: More
Precise and Expressive Mode Systems for Typed Logic Programming.. - Overton (2003)
(Correct)
A Pure Meta-Interpreter for Flat GHC, A Concurrent Constraint.. - Ueda
(Correct)
Resource-Passing Concurrent Programming - Ueda
(Correct)
Active bibliography (related documents): More All
0.6: Error-correcting Source Code - Yasuhiro Ajiro Kazunori (1998)
(Correct)
0.3: Automated Programming Framework Using - Constraint-Based Static Analysis
(Correct)
0.3: Kima: an Automated Error Correction System for Concurrent Logic .. - Ajiro, Ueda (2000)
(Correct)
Similar documents based on text: More All
0.9: I/O Mode Analysis in Concurrent Logic Programming - Ueda (1995)
(Correct)
0.7: Guarded Horn Clauses - Ueda (1986)
(Correct)
0.7: Concurrent Logic/Constraint Programming: The Next 10 Years - Kazunori Ueda Waseda (1999)
(Correct)
Related documents from co-citation: More All
3: Moded Flat GHC and Its Message-Oriented Implementation Technique
- Ueda - 1994
3: Experiences with Strong Moding in Concurrent Logic/Constraint Programming (context) - Ueda - 1996
3: Guarded Horn Clauses
- Ueda - 1986
BibTeX entry: (Update)
K. Ueda. Linearity analysis of concurrent logic programs. In M. Leuschel, editor, Optimisation and Implementation of Declarative Programs, (WOID'99), a ICLP'99 workshop, 1999. 14 pages. http://citeseer.ist.psu.edu/ueda99linearity.html More
@article{ ueda99linearity,
author = "Kazunori Ueda",
title = "Linearity Analysis of Concurrent Logic Programs",
journal = "Electronic Notes in Theoretical Computer Science",
volume = "30",
number = "2",
year = "1999",
url = "citeseer.ist.psu.edu/ueda99linearity.html" }
Citations (may not include all citations):
144
Garbage Collection: Algorithms for Automatic Dynamic Memory .. (context) - Jones, Lins - 1996
108
Linearity and the Pi-calculus
- Kobayashi, Pierce et al. - 1996 ACM DBLP
81
Once Upon a Type
- Turner, Wadler et al. - 1995
56
Janus: A Step Towards Distributed Constraint Programming (context) - Saraswat, Kahn et al. ACM DBLP
27
Moded Flat GHC and Its Message-Oriented Implementation Techn..
- Ueda, Morita - 1994 ACM DBLP
24
Multiple Reference Management in Flat GHC (context) - Chikayama, Kimura - 1987 DBLP
8
Experience with Strong Moding Concurrent LogicConstraint Pro.. (context) - with, in et al. - 1996
7
Diagnosing Non-Well-Moded Concurrent Logic Programs (context) - Cho, Ueda DBLP
3
klint --- Static Analyzer for KL1 Programs (context) - Ueda - 1998
2
Moded Flat GHC for Data-Parallel Programming (context) - Ueda - 1994
1
Distributed Implementation KL Multi PSIV (context) - Ichiyoshi, Chikayama et al. - 1989
Documents on the same site (http://www.ueda.info.waseda.ac.jp/~ueda/papers.html): More
Making Exhaustive Search Programs Deterministic, Part II - Ueda
(Correct)
Theory and Practice of Concurrent Systems - The Role of Kernel.. - Ueda
(Correct)
Moded Flat GHC for Data-Parallel Programming (Extended Abstract) - Ueda
(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