Kazunori Ueda. Linearity analysis of concurrent logic programs. In Michael Leuschel, editor, Proceedings of the International Workshop on Optimization and Implementation of Declarative Programs, volume 30 of Electronic Notes in Theoretical Computer Science. Elsevier, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Module Based Analysis for Memory Reuse in Mercury - Mazur, Janssens, Bruynooghe (2000) (3 citations) (Correct)
.... this handicap and improve the memory management, both for logic programming languages [5, 12, 14] as for functional programming languages [10, 19] Some approaches 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 implementation, so this largely remains an unsolved problem. A language as Mercury, a logic language with declarations [17] o ers a partial solution through the ....
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.
A Pure Meta-Interpreter for Flat GHC, A Concurrent Constraint.. - Ueda Self-citation (Ueda) (Correct)
....three or more occurrences by giving the former more generic, less constrained modes. Our setarg 5 does not copy or discard the (direct or indirect) access paths to the elements of an array, including the element to be removed and the element with which to fill in the blank. Linearity analysis [33] for Mode Flat GHC is more directly concerned with the number of access paths. Under reasonable conditions, it enables us to implement setarg 5 as destructive update as long as the original structure is not shared. Both mode and linearity systems encourage resource conscious programming. ....
....mode and linearity systems encourage resource conscious programming. Resource conscious programming means to pay attention to the number of occurrences of each variable and to prefer variables with exactly two occurrences. This is not so restrictive as it might seem, and our static analyzer klint [33] and an automated debugger kima [2] 3] support it by detecting and even correcting inadvertently too many or too few occurrences of the variables. Resourceconscious programs are easier to execute on a distributed platform because they can benefit more from compile time garbage collection. ....
Ueda, K., Linearity Analysis of Concurrent Logic Programs. In Proc. Int. Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications, Ito, T. and Yuasa, T. (eds.), World Scientific, Singapore, 2000, pp. 253--270.
Resource-Passing Concurrent Programming - Ueda (2 citations) Self-citation (Ueda) (Correct)
....in the absence of choice operators. In constraintbased concurrency, non destructiveness of ask is used to model one way multicasting or data sharing naturally. 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 concurrency included into name based concurrency only recently by the Fusion calculus [48] is that two channels can be fused into a single channel. 2.4 ....
....unary or binary constraints. Actually they were reduced to 6 constraints of the form m p 1 = m p 2 and 72 constraints of the form m p = IN. This means that nonlinear variables were all used under simple, one way communication protocols. 4. 2 The Linearity System The purpose of linearity analysis [46] is to statically analyze exactly where nonlinear variables and shared data structures may occur in which predicates, in which arguments, and in which part of the data structures carried by those arguments. This complements mode analysis in the sense that it is concerned with the number of read ....
Ueda, K., Linearity Analysis of Concurrent Logic Programs. In Proc. Int. Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications, Ito, T. and Yuasa, T. (eds.), World Scientific, 2000, pp. 253--270.
Precise and Expressive Mode Systems for Typed Logic Programming.. - Overton (2003) (Correct)
No context found.
Kazunori Ueda. Linearity analysis of concurrent logic programs. In Michael Leuschel, editor, Proceedings of the International Workshop on Optimization and Implementation of Declarative Programs, volume 30 of Electronic Notes in Theoretical Computer Science. Elsevier, 1999.
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