Friedman, D. P., and Haynes, C. T. Constraining Control. In Proceedings of the 12th Annual ACM Conference on Principles of Programming Languages. ACM, New York, 1985, pp. 245-254. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Linear Continuation-Passing - Berdine, O'Hearn, Reddy, Thielecke (2002) (Correct)
....by studying the typing properties of their semantics. An example of this is contained in the observation that first class continuations break linear typing, while exceptions do not. Also, although work on constraining the power of continuations has been done, for example Friedman and Haynes [12], the constraints generally take the form of assertions checked at runtime which ensure a program s dynamic behaviour obeys certain invariants. This paper, on the other hand, presents a static type system, and many of the usual advantages (static check ability, unnecessity of runtime checks, etc. ....
Friedman, D. P. and C. T. Haynes: 1985, `Constraining Control'. In: Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages. pp. 245--254.
Advanced Control Flows for Flexible Graphical User.. - Graunke, Krishnamurthi (2002) (Correct)
....will go unheeded because the sentinel has no spawning stack left to resume. For some applications, such as installers, permitting only one final selection is usually the correct semantics. In this case, our transformer can easily generate the appropriate code to implement one shot semantics [19]. For many other applications, however, users should be free to take multiple choices through to completion. For instance, perhaps the user wants to book several related flights (the cities may be the same, but the dates may differ) or to generate multiple, related network configurations using ....
Haynes, C. T. and D. P. Friedman. Constraining control. In 12th ACM Symposium on Principles of Programming Langauges, 1985.
Linear Continuation-Passing - Berdine, O'Hearn (2002) (Correct)
....by studying the typing properties of their semantics. An example of this is contained in the observation that rst class continuations break linear typing, while exceptions do not. Also, although work on constraining the power of continuations has been done, for example Friedman and Haynes [12], the constraints generally take the form of assertions checked at runtime which ensure a program s dynamic behaviour obeys certain invariants. This paper, on the other hand, presents a static type system, and many of the usual advantages (static check ability, unnecessity of runtime checks, etc. ....
Friedman, D. P. and C. T. Haynes: 1985, `Constraining Control'. In: Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages. pp. 245-254.
Tinkertoy Transactions - Haines, Kindred, Morrisett, Nettles, .. (1993) (1 citation) (Correct)
....we cannot guarantee that a computation will pass through our handlers. For example, if call cc were exported to the user, we could not guarantee that a skein s completer function would be called. An alternative solution would be to implement a mechanism similar to Scheme s unwind protect [7, 21]. functor Account (structure Venari: VENARI) ACCOUNT = struct type account = real R.rwref fun newaccount ( R.rwref (0.0, L.rwlock( fun deposit account amount = let fun dodeposit ( L.acquirewrite (R.lockof account) R.rwset account ( R.rwget account) amount) in V.transact dodeposit ....
Friedman and Haynes. Constraining control. In Proceedings of ACM Symp. on Prog. Lang., 1985.
Composing First-Class Transactions - Haines, Kindred, Morrisett.. (1994) (7 citations) (Correct)
....we cannot guarantee that a computation will pass through our handlers. For example, if continuations were exported to the user, we could not guarantee that a skein s completer function would be called. A solution to this problem would be to implement a mechanism similar to Scheme s unwind protect [Friedman and Haynes 1985; Rees 1992] We also successfully achieved a factorization of transactions into their component parts. We found that to allow transactions of any type to execute concurrently requires the use of R W locks. That support for concurrency needs support for synchronization should come as little ....
Friedman and Haynes 1985. Constraining control. In Proceedings of ACM Symp. on Prog. Lang.
Reasoning about Continuations - With Control Effects (Correct)
No context found.
Friedman, D. P., and Haynes, C. T. Constraining Control. In Proceedings of the 12th Annual ACM Conference on Principles of Programming Languages. ACM, New York, 1985, pp. 245-254.
Web Interactions - Graunke (2003) (Correct)
No context found.
Haynes, C. T. and D. P. Friedman. Constraining control. In 12th ACM Symposium on Principles of Programming Langauges, pages 245-254, 1985.
Definition Version 0.7.5 - Julian Padget Greg (Correct)
No context found.
Friedman D. & Haynes C., Constraining Control, Proceedings of 11th Annual ACM Symposium on Principles of Programming Languages, pp245-254, published by ACM Press, New York, 1985.
Embedding Type Structure in Semantics - Wand (1985) (8 citations) (Correct)
No context found.
Friedman, D.P., and Haynes, C.T. "Constraining Control," Conf. Rec. ACM Symp. on Principles of Programming Languages (1985).
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