J. H. Reppy. Higher-order concurrency. PhD thesis, Computer Science Department, Cornell University, Ithaca, NY, January 1992. Available as Cornell Technical Report 92-1285.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....callcc (call with current continuation) which rei es the entire control context as a function and passes it to another function, and throw which invokes a continuation on an argument, aborting the current computation. Continuations can be used to implement other control features, e.g. concurrency [18]. Both exceptions and continuations preserve the inherent type soundness properties of ML. In this paper we give a generalization of the continuation mechanism of [3] for a language with an ML style type system. We prove that the language is type safe, i.e. evaluation of programs cannot generate ....

J. H. Reppy. Higher-order concurrency. PhD thesis, Computer Science Department, Cornell University, Ithaca, NY, January 1992. Available as Cornell Technical Report 92-1285.

....(call with current continuation) which reifies the entire control context as a function and passes it to another function, and throw which invokes a continuation on an argument, aborting the current computation. Continuations can be used to implement other control features, e.g. concurrency [18]. Both exceptions and continuations preserve the inherent type soundness properties of ML. In this paper we give a generalization of the continuation mechanism of [3] for a language with an MLstyle type system. We prove that the language is type safe, i.e. evaluation of programs cannot generate ....

J. H. Reppy. Higher-order concurrency. PhD thesis, Computer Science Department, Cornell University, Ithaca, NY, January 1992. Available as Cornell Technical Report 92-1285.

....throw which invokes a continuation on an argument. Both mechanisms, particularly the exception mechanism, are useful: exceptions can be used to recover from errors in an efficient, elegant, and uncluttered way, and continuations can be used to implement other control features, e.g. concurrency [14]. It is folklore that neither exceptions nor continuations can be expressed as a macro in terms of the other (at least if no references or extensible datatypes are present) even though they are closely related. In this paper we provide a generalization of simple exceptions and continuations. The ....

.... into SML NJ, e.g. and [ x: a] fn x = a] Appendix A gives an implementation of this module using some type unsafe features in SML NJ; our type soundness Theorem 3 guarantees that translated expressions can never cause a run time type error (like the implementation of CML [14], which also uses unsafe features of SML NJ) We have developed an informal argument for the correctness of the implementation of our module; a fully formal argument is one of our current interests. Notice that the signature involves weak type variables (cf. 8, 19] If SML were modified to have ....

John H. Reppy. Higher-order concurrency. PhD thesis, Computer Science Department, Cornell University, Ithaca, NY, January 1992. Available as Cornell Technical Report 92-1285.

....addition to channels, ML2000 also provides synchronous memory in the form of I structures [2] and Mstructures [3] The semantics of ML2000 must also specify the behavior of unsynchronized uses of shared memory. Such behavior is not easy to specify: an interleaving semantics, such as those for CML [4, 42], requires sequential consistency, but sequential consistency imposes a significant implementation cost on modern multiprocessors. Therefore, we need a weaker model, such as release consistency [16] for ML2000, and must specify the memory consistency model as a global property of program ....

J. H. Reppy. Higher-order concurrency. PhD thesis, Computer Science Department, Cornell University, Ithaca, NY, January 1992. Available as Cornell Technical Report 92-1285.

....throw which invokes a continuation on an argument. Both mechanisms, particularly the exception mechanism, are useful: exceptions can be used to recover from errors in an efficient, elegant, and uncluttered way, and continuations can be used to implement other control features, e.g. concurrency [19]. It is folklore (the authors know of no published proof) that neither exceptions nor continuations can be expressed as a macro in terms of the other (at least if no references are present) even though they are closely related. In this paper we provide a generalization of simple exceptions and ....

John H. Reppy. Higher-order concurrency. PhD thesis, Computer Science Department, Cornell University, Ithaca, NY, January 1992. Available as Cornell Technical Report 92-1285.

No context found.

J. H. Reppy. Higher-order concurrency. PhD thesis, Computer Science Department, Cornell University, Ithaca, NY, January 1992. Available as Cornell Technical Report 92-1285.

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