Making choices lazily

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Making choices lazily

Full text

Pdf (1.27 MB)

Source

Functional Programming Languages and Computer Architecture archive
Proceedings of the seventh international conference on Functional programming languages and computer architecture table of contents

La Jolla, California, United States

Pages: 108 - 119

Year of Publication: 1995

ISBN:0-89791-719-7

Authors

John Hughes	Department of Computing Science, Chalmers University of Technology and University of Göteborg, S-412 96 Göteborg, Sweden
Andrew Moran	Department of Computing Science, Chalmers University of Technology and University of Göteborg, S-412 96 Göteborg, Sweden

Sponsors

IFIP WG 2.8 : IFIP WG 2.8
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 16, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/224164.224191 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Zena M. Ariola , John Maraist , Martin Odersky , Matthias Felleisen , Philip Wadler, A call-by-need lambda calculus, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.233-246, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199507]
	2	Gérard Boudol, Lambda-calculi for (strict) parallel functions, Information and Computation, v.108 n.1, p.51-127, Jan. 1994 [doi>10.1006/inco.1994.1003]
	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.
	4	Magnus Carlsson , Thomas Hallgren, FUDGETS: a graphical user interface in a lazy functional language, Proceedings of the conference on Functional programming languages and computer architecture, p.321-330, June 09-11, 1993, Copenhagen, Denmark [doi>10.1145/165180.165228]
	5	William Clinger, Nondeterministic call by need is neither lazy nor by name, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.226-234, August 15-18, 1982, Pittsburgh, Pennsylvania, United States [doi>10.1145/800068.802154]
	6	P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Principles of Programming Languages, January 1991.
	7	Ugo de'Liguoro , Adolfo Piperno, Must Preorder in Non-Deterministic Untyped Lambda-Calculus, Proceedings of the 17th Colloquium on Trees in Algebra and Programming, p.203-220, February 26-28, 1992
	8	Carl A. Gunter, Relating total and partial correctness interpretations of non-deterministic programs, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.306-319, December 1989, San Francisco, California, United States [doi>10.1145/96709.96741]
	9	R. Heckmann, Set domains, Proceedings of the third European symposium on programming on ESOP '90, p.177-196, May 1990, Copenhagen, Denmark
	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.
	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.
	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.
	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.
	14	John Launchbury, A natural semantics for lazy evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.144-154, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158618]
	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.
	16	A. Moran. Natural Semantics for Non-Determinism. Licentiate Thesis, Chalmers University of Technology and University of G5teborg, Sweden, May 1994.
	17	G. D. Plotkin. A powerdomain construction. SIAM Journal on Computing, 5(3):452-487, 1976.
	18	M. B. Smyth. Power domains. Journal of Computer and System Sciences, 16(23-26):23-35, 1978.
	19	Michael B. Smyth, Power Domains and Predicate Transformers: A Topological View, Proceedings of the 10th Colloquium on Automata, Languages and Programming, p.662-675, July 18-22, 1983
	20	H. Søndergaard , P. Sestoft, Non-determinism in functional languages, The Computer Journal, v.35 n.5, p.514-523, Oct. 1992 [doi>10.1093/comjnl/35.5.514]
	21	W. Stoye. A new scheme for writing functional operating systems. Technical Report 56, University of Cambridge Computing Laboratory, 1984.
	22	David Turner, An approach to functional operating systems, Research topics in functional programming, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990

CITED BY 5

	Andrew Moran , David Sands, Improvement in a lazy context: an operational theory for call-by-need, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.43-56, January 20-22, 1999, San Antonio, Texas, United States
	Ricardo Peña , Clara Segura, Non-determinism analyses in a parallel-functional language, Journal of Functional Programming, v.15 n.1, p.67-100, January 2005
	Joseph M. Morris , Malcolm Tyrrell, Dually nondeterministic functions, ACM Transactions on Programming Languages and Systems (TOPLAS), v.30 n.6, p.1-34, October 2008
	David Sabel , Manfred Schmidt-schauss, A call-by-need lambda calculus with locally bottom-avoiding choice: Context lemma and correctness of transformations, Mathematical Structures in Computer Science, v.18 n.3, p.501-553, June 2008
	Xavier Leroy , Hervé Grall, Coinductive big-step operational semantics, Information and Computation, v.207 n.2, p.284-304, February, 2009