John Hughes
- 1.Z. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler. A call-by-need lambda calculus. In Conference Record of the 22th A CM Symposium on Pmnciples of Programming Languages, pages 233-246, 1995. Google Scholar
Digital Library
- 2.G. Boudol. Lambda-calculi for (strict) parallel functions. Information and Computation, 1992. Google ScholarDigital Library
- 3.M. Broy. Fixed point theory for communication and concurrency. In D. Bj0rner, editor, Formal Descriptwn of Programming Concepts-II, pages 125-147. IFIP, North Holland, 1983.Google Scholar
- 4.M. Carlsson and T. Hallgren. FUDGETS- A Graphical User Interface in a Lazy Functional Language. In FPCA '93- Conference on Functional Programming Languages and Computer Architecture, pages 321-330. ACM Press, June 1993. Google ScholarDigital Library
- 5.W. Clinger. Nondeterministic call by need is neither lazy nor by name. In Lisp and Functional Programming, pages 226-234, August 1982. Google ScholarDigital Library
- 6.P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Principles of Programming Languages, January 1991.Google Scholar
- 7.U. de'Liguoro and A. Piperno. Must preorder in nondeterministic untyped A-calculus. In CAAP '92, volume 58t of LNCS, pages 203-220, February 1992. Google ScholarDigital Library
- 8.C. A. Gunter. Relating total and partial correctness interpretations of non-deterministic programs. In Principles of Programming Languages, January 1990. Google ScholarDigital Library
- 9.R. Heckmann. Set domains. In E$OP '90, volume 432 of LNCS, pages 177-196, May 1990. Google Scholar
- 10.P. Henderson. Purely functional operating systems. In J. Daxlington, P. Henderson, and D. A. Turner, editors, Functional Programming and its Applications, pages 177-192. Cambridge University Press, 1982.Google Scholar
- 11.M. C. B. Hennessy. The semantics of call-by-value and call-by-name in a nondeterministic environment. SIAM Journal on Computing, 9(1):67-84, February 1980.Google ScholarCross Ref
- 12.M. C. B. Hennessy and E. A. Ashcroft. A mathematical semantics for a nondeterministic typed A-calculus. Theoretical Computer Science, 11:227-245, 1980.Google ScholarCross Ref
- 13.S. B. Jones. A range of operating systems written in a purely functional style. PRG Technical Monograph PRG-42, Oxford University Computing Laboratory, 1984.Google Scholar
- 14.J. Launchbury. A natural semantics for laziness. In Princzples of Programmzng Languages, January 1993. Google ScholarDigital Library
- 15.J. McCarthy. A basis for a mathematical theory of computations. In P. Braffort and D. Hirschberg, editors, Computer Programming and Formal Systems, pages 33-70. North-Holland, 1963.Google ScholarCross Ref
- 16.A. Moran. Natural Semantics for Non-Determinism. Licentiate Thesis, Chalmers University of Technology and University of G5teborg, Sweden, May 1994.Google Scholar
- 17.G. D. Plotkin. A powerdomain construction. SIAM Journal on Computing, 5(3):452-487, 1976.Google ScholarCross Ref
- 18.M. B. Smyth. Power domains. Journal of Computer and System Sciences, 16(23-26):23-35, 1978.Google ScholarCross Ref
- 19.M. B. Smyth. Power domains and predicate transformers: A topological view. In ICALP '83, volume 154 of LNCS, pages 662-676, 1983. Google Scholar
- 20.H. Sondergaard and P. Sestoft. Non-determinism in functional languages. The Computer Journal, 35(5):514-523, October 1992. Google ScholarDigital Library
- 21.W. Stoye. A new scheme for writing functional operating systems. Technical Report 56, University of Cambridge Computing Laboratory, 1984.Google Scholar
- 22.D. A. Turner. An approach to functional operating systems. In D. A. Turner, editor, Research Topics in Functional Programming. Addison Wesley, 1990. Google ScholarDigital Library
Index Terms
- Making choices lazily
Recommendations
Making aesthetic choices
IJCAI'79: Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1A framework is presented for making choices that are primarily constrained by aesthetic, as opposed to pragmatic, considerations. An example of the application of this framework is a computer system called "Ani", capable of making simple computer ...
Choice Architecture, Framing, and Cascaded Privacy Choices
For consumers, managing privacy online requires navigating a complex process of interrelated choices. This process may be conceived of as “cascaded,” in that a combination of upstream choices (e.g., of privacy settings on a social network site) and ...
Making snapshot isolation serializable
Snapshot Isolation (SI) is a multiversion concurrency control algorithm, first described in Berenson et al. [1995]. SI is attractive because it provides an isolation level that avoids many of the common concurrency anomalies, and has been implemented by ...
Comments