N. Kobayashi. Concurrent Linear Logic Programming. PhD thesis, Department of Information Science, University of Tokyo, Apr. 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the program has the form: val r = newRef String Once ) r.set) Paumanock ) run print ( r. get) 5 Related Work Pict belongs to a sizeable family of concurrent programming language designs inspired by theoretical calculi, also including Vasconcelos s TyCo [Vas94] Kobayashi s HACL [Kob96] and numerous actor languages [Hew77, Agh86, etc. A particularly close relative is the language Oz [Smo95] which integrates functional, object oriented, and concurrent constraint programming by translation into a common core calculus [Smo94] Although this calculus uses concurrent constraints ....

Naoki Kobayashi. Concurrent Linear Logic Programming. PhD thesis, Department of Information Science, University of Tokyo, April 1996.

....elimination. By a similar method, TLL will be able to extend to second order and be able to show the similar result. We restricted the time concept to discrete and linear time in this thesis. We think that it will not be di#cult to extend this concept to continuous linear time using the idea in [19] as follows: We introduce a new formula # t 1 t 2 A to mean A can be used exactly once during time t 1 to t 2 . #A can be considered a shorthand form for # 1 1 A, and #A for # 0 # A. Timed Petri nets are encoded naturally into ITLL # , which is a subsystem of TLL. The reachability ....

Naoki Kobayashi. Concurrent Linear Logic Programming. PhD thesis, The University of Tokyo, April 1996.

....top of it. We propose an algorithm to translate a concurrent calculus into a sequential language with explicit control flow. Concurrent calculi have been drawing attention as a theoretical foundation of a wide range of concurrent languages. A variety of concurrent calculi have been proposed so far [22, 24, 27, 28]. Useful characteristics of concurrent calculi include simplicity, generality, clear syntax, and clear semantics. The advantages have enabled us to deal with programming languages formally and have brought us many fruitiful theoretical and practical achievements including optimization techniques ....

....to languages which are designed without the notion of a concurrent calculus because a concurrent calculus is powerful enough to express most of well known parallel constructs such as asynchronous function call. The concurrent calculus used in this thesis is HACL, proposed by Kobayashi et al. in [22, 24]. The sequential target language is an ML like language, which can be understood with no difficulty by those who are familiar with ML [29] The compilation algorithm is described in the form of translation rules, which makes the discussion very clear. HACL is powerful enough, but it seems to be ....

[Article contains additional citation context not shown here]

Naoki Kobayashi. Concurrent Linear Logic Programming. PhD thesis, University of Tokyo, January 1996.

.... the method of proof of our main complexity result shows that, aside from complexity bounds, decision problems that involve temporal constraints may be dealt with by running a finite proof search, with some guidance, in the available concurrent logic programming environments based on linear logic [9, 10, 24, 25, 41, 30, 31, 32, 13] or in the environments supporting multiset rewriting [17, 22] or concurrent rewriting [40, 44] either of which would in this case act as sort of model checkers. Indeed, our current work may be seen as a first step toward a larger issue of proof based state exploration in contrast to ....

....Gate(up) is provable in linear logic from the axioms U , while the formula (Tr(safe) Omega Sig(low) Omega Gate(down) Gammaffi (Tr(safe) Omega Sig(low) Omega Gate(up) is not provable in linear logic from the axioms U . That is, in the available linear logic programming environments such as [9, 10, 24, 25, 41, 30, 31, 32, 13], given U and an initial condition Tr(safe) Omega Sig(low) Omega Gate(down) the query on the goal Tr(safe) Omega Sig(raise) Omega Gate(up) will be answered positively, while the query on the goal Tr(safe) Omega Sig(low) Omega Gate(up) will be answered negatively. 2.2 Specifying Timed ....

[Article contains additional citation context not shown here]

N. Kobayashi. Concurrent linear logic programming. Dissertation, University of Tokyo, 1996.

....primitives [FGL 96] Cardelli s Obliq [Car95] achieves related aims by building on a primitive notion of network objects. Pict belongs to a sizeable family of concurrent programming language designs inspired by theoretical calculi, including Vasconcelos s TyCo [Vas94] Kobayashi s HACL [Kob96] and numerous actor languages [Hew77, Agh86, etc. A particularly close relative is the language Oz [Smo95] which integrates functional, object oriented, and concurrent constraint programming by translation into a common core calculus [Smo94] Although this calculus uses concurrent constraints ....

Naoki Kobayashi. Concurrent Linear Logic Programming. PhD thesis, Department of Information Science, University of Tokyo, April 1996.

No context found.

N. Kobayashi. Concurrent Linear Logic Programming. PhD thesis, Department of Information Science, University of Tokyo, Apr. 1996.

....University of Tokyo 7 3 1 Hongo, Bunkyo ku, Tokyo 113, Japan A Partially Deadlock free Typed Process Calculus (II) Naoki Kobayashi Department of Information Science University of Tokyo email:koba is.s.u tokyo.ac. jp 1 Introduction Backgrounds and Problems Various concurrent programming languages [22, 24, 19, 7, 18, 15] have recently been proposed and are attracting a great deal of attention because of their usefulness in describing symbolic numeric computations for parallel distributed environments and inherently concurrent applications such as GUIs. Many of them share some common primitives for concurrent ....

Naoki Kobayashi. Concurrent linear logic programming. Doctoral Thesis, Department of Information Science, Unversity of Tokyo, April 1996.

.... Also, even on sequential environments, concurrency primitives are useful for describing interactive applications such as graphical user interfaces[1] For these purposes, a number of concurrent programming languages or concurrent extensions of sequential programming languages have been proposed[23, 25, 20, 8, 19, 15]. However, naive introduction of concurrency primitives obviously loses many good properties of programs. For example, if we extend functional programming languages with concurrency primitives[20, 15] then programs do not behave like functions any more. In order to illustrate the problem, ....

....and registers effectively with the assumption that evaluation may be blocked. Recently, a number of studies focused on concurrency primitives and tried to obtain better foundations. There are a number of researches on process equivalence[13, 21, 5] type systems[3, 17, 9] relationship with logic[8, 22], etc. Concurrent programming languages directly based on such new foundations have also been designed and implemented[19, 10] However, such foundations essentially have not been able to solve the above problems. Rather, if we naively throw away function primitives and work only with concurrency ....

Naoki Kobayashi. Concurrent linear logic programming. Doctoral Thesis, Department of Information Science, Unversity of Tokyo, April 1996.

No context found.

Naoki Kobayashi. Concurrent Linear Logic Programming. PhD thesis, The University of Tokyo, April 1996.

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