An overview of Miranda

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An overview of Miranda

Full text

Pdf (658 KB)

Source

ACM SIGPLAN Notices archive
Volume 21 , Issue 12 (December 1986) table of contents

Pages: 158 - 166

Year of Publication: 1986

ISSN:0362-1340

Author

D Turner

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 27, Citation Count: 30

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	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/15042.15053 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	Milner "A Theory of Type Polymorphism in Programming" Journal of Computer and System Sciences, vol. 17, 1978.
	2	Simon Thompson, Laws in Miranda, Proceedings of the 1986 ACM conference on LISP and functional programming, p.1-12, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319839]
	3	D. A. Turner, Miranda: a non-strict functional language with polymorphic types, Proc. of a conference on Functional programming languages and computer architecture, p.1-16, January 1985, Nancy, France

CITED BY 30

	Roger L. Wainwright, Introducing functional programming in discrete mathematics, ACM SIGCSE Bulletin, v.24 n.1, p.147-152, March 1992
	D. A. Turner, SNACC: a parser generator for use with Miranda, Proceedings of the 1996 ACM symposium on Applied Computing, p.401-407, February 17-19, 1996, Philadelphia, Pennsylvania, United States
	Jesper Jørgensen, Generating a compiler for a lazy language by partial evaluation, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.258-268, January 19-22, 1992, Albuquerque, New Mexico, United States
	F. Warren Burton, Indeterminate behavior with determinate semantics in parallel programs, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.340-346, September 11-13, 1989, Imperial College, London, United Kingdom
	Guy E. Blelloch , Jonathan C. Hardwick , Siddhartha Chatterjee , Jay Sipelstein , Marco Zagha, Implementation of a portable nested data-parallel language, ACM SIGPLAN Notices, v.28 n.7, p.102-111, July 1993
	Rex L. Page , Brian D. Moe, Experience with a large scientific application in a functional language, Proceedings of the conference on Functional programming languages and computer architecture, p.3-11, June 09-11, 1993, Copenhagen, Denmark
	Kim B. Bruce, Attracting (& keeping) the best and the brightest: an entry-level course for experienced introductory students, ACM SIGCSE Bulletin, v.26 n.1, p.243-247, March 1994
	Dennis M. Volpano, Subtypes and quantification, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.4, p.631-632, Oct. 1991
	F. Warren Burton, Type extension through polymorphism, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.1, p.135-138, Jan. 1990
	S. Thompson, Functional programming: executable specifications and program transformations, ACM SIGSOFT Software Engineering Notes, v.14 n.3, p.287-290, May 1989
	Malcolm P. Atkinson , O. Peter Buneman, Types and persistence in database programming languages, ACM Computing Surveys (CSUR), v.19 n.2, p.105-170, June 1987
	Jayadev Misra, Powerlist: a structure for parallel recursion, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.6, p.1737-1767, Nov. 1994
	Fritz Henglein, Type inference with polymorphic recursion, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.2, p.253-289, April 1993
	Fritz Henglein, Type inference and semi-unification, Proceedings of the 1988 ACM conference on LISP and functional programming, p.184-197, July 25-27, 1988, Snowbird, Utah, United States
	Andrew L. Wendelborn , H. Garsden, Exploring the Stream Data Type in SISAL and Other Languages, Proceedings of the IFIP WG10.3. Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism, p.283-294, January 20-22, 1993
	Gordon S. Novak, Jr., Software Reuse by Specialization of Generic Procedures through Views, IEEE Transactions on Software Engineering, v.23 n.7, p.401-417, July 1997
	Eduardus A. T. Merks , J. Michael Dyck , Robert D. Cameron, Language Design for Program Manipulation, IEEE Transactions on Software Engineering, v.18 n.1, p.19-32, January 1992
	Mandayam Srivas , Mark Bickford, Formal Verification of a Pipelined Microprocessor, IEEE Software, v.7 n.5, p.52-64, September 1990
	F. Warren Burton , John (Yannis) G. Kollias, Functional Programming with Quadtrees, IEEE Software, v.6 n.1, p.90-97, January 1989
	Gordon S. Novak Jr., Creation of Views for Reuse of Software with Different Data Representations, IEEE Transactions on Software Engineering, v.21 n.12, p.993-1005, December 1995
	Richard A. Frost, Realization of natural language interfaces using lazy functional programming, ACM Computing Surveys (CSUR), v.38 n.4, p.11-es, 2006
	Malcolm Dowse , Andrew Butterfield, Modelling deterministic concurrent I/O, ACM SIGPLAN Notices, v.41 n.9, September 2006
	Paul Hudak , John Hughes , Simon Peyton Jones , Philip Wadler, A history of Haskell: being lazy with class, Proceedings of the third ACM SIGPLAN conference on History of programming languages, p.12-1-12-55, June 09-10, 2007, San Diego, California
	Peter Greenfield, Bagof/3 to ZF expression: an example prolog application manually translated to Miranda, ACM SIGPLAN Notices, v.25 n.7, p.59-62, July 1990
	Jacek Passia , Klaus-Peter Löhr, Fips: a functional-imperative language for explorative programming, ACM SIGPLAN Notices, v.28 n.5, p.39-48, May 1993
	Jerzy A. Piotrowski, Translation—an introductory exercise, ACM SIGCSE Bulletin, v.24 n.2, p.20-28, June 1992
	Melissa E. O'Neill , F. Warren Burton, A new method for functional arrays, Journal of Functional Programming, v.7 n.5, p.487-513, September 1997
	Robert F. Stärk, Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages, Journal of Functional Programming, v.8 n.2, p.97-129, March 1998
	David A. Schmidt, Induction, Domains, Calculi: Strachey's Contributions to Programming-Language Engineering, Higher-Order and Symbolic Computation, v.13 n.1-2, p.89-101, April 2000
	Burton M. Leavenworth , Jean E. Sammet , David Hemmendinger, Nonprocedural languages, Encyclopedia of Computer Science, 4th edition, John Wiley and Sons Ltd., Chichester, 2003