A simple applicative language: mini-ML

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A simple applicative language: mini-ML

Full text

Pdf (1.05 MB)

Source

Conference on LISP and Functional Programming archive
Proceedings of the 1986 ACM conference on LISP and functional programming table of contents

Cambridge, Massachusetts, United States

Pages: 13 - 27

Year of Publication: 1986

ISBN:0-89791-200-4

Authors

Dominique Clément	SEMA, Sophia-Antipolis
Thierry Despeyroux	INRIA, Sophia-Antipolis, Route des Lucioles, 06565 Valbonne Cedex, France
Gilles Kahn
Joëlle Despeyroux

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 14, Downloads (12 Months): 72, Citation Count: 31

Additional Information:

references cited by 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/319838.319847 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	CARDELLI L., 'Basic Polymorphic Type-checking', Polymorphism, January 1985.
	2	CLI~MENT D., J. DESPEYROUX, T. DESPEYROUX, L. HASCOET, G.KAHN, "Natural Semantics on the Computer", INRIA Research Report RR 416, INRiA- Sophia-Antipolis, June 1985.
	3	G. Cousineau , P. L. Curien , M. Mauny, The categorical abstract machine, Proc. of a conference on Functional programming languages and computer architecture, p.50-64, January 1985, Nancy, France
	4	Luis Damas , Robin Milner, Principal type-schemes for functional programs, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.207-212, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582176]
	5	D~SPEYROUX J., 'Proof of Translation in Natural Semantics', Symposium on Logic in Computer Science, Cambridge, Massachussets, June 1986.
	6	DESPEYROUX T., "Executable Specification of Static Semantics", Semantics of Data Types, Lecture Notes in Computer Science, Vol. 173, June 1984.
	7	GORDON M., R. MILNER, C. WADSWORTH, G. COUSINBAU, G.HUBT, L. PAULSON, "The ML Handbook, Version 5.1', iNRIA, October 1984.
	8	G. HUET "Computation and Deduction', Carnegie Mellon Course Notes, CMU, 1986.
	9	Nancy McCracken, The typechecking of programs with implicit type structure., Proc. of the international symposium on Semantics of data types, p.301-315, July 1984, Sophia-Antipolis, France
	10	David MacQueen, Modules for standard ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.198-207, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802036]
	11	MILNER R. ~A Theory of Type Polymorphism in Programming", Journal of Computer and System Sciences~ n.17, 1978, pp.348-375.
	12	Alan Mycroft, Polymorphic Type Schemes and Recursive Definitions, Proceedings of the 6th Colloquium on International Symposium on Programming, p.217-228, April 17-19, 1984
	13	PLOTKIN G.D., "A Structural Approach to Operational Semantics", DAIMI FN-19, Computer Science Department, Aarhus University, karhus, Denmark, September 1981.
	14	J C Reynolds, Three approaches to type structure, Proc. of the international joint conference on theory and practice of software development (TAPSOFT) Berlin, March 25-29, 1985 on Mathematical foundations of software development, Vol. 1: Colloquium on trees in algebra and programming (CAAP'85), p.97-138, April 1985, Berlin, Germany
	15	WARREN D.H.D., "Logic Programming and Compiler writing", Software-Practice and Experience, 10, 1980, pp.97-125.

CITED BY 31

	Peter J. Thiemann, Unboxed values and polymorphic typing revisited, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.24-35, June 26-28, 1995, La Jolla, California, United States
	Mitchell Wand , Patrick O'Keefe, On the complexity of type inference with coercion, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.293-298, September 11-13, 1989, Imperial College, London, United Kingdom
	Mitchell Wand , Dino P. Oliva, Proving the correctness of storage representations, ACM SIGPLAN Lisp Pointers, v.V n.1, p.151-160, Jan. 1992
	Isabelle Attali , Denis Caromel , Sidi Ould Ehmety, A natural semantics for Eiffel dynamic binding, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.6, p.711-729, Nov. 1996
	A. J. Kfoury , J. Tiuryn , P. Urzyczyn, Type reconstruction in the presence of polymorphic recursion, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.2, p.290-311, April 1993
	A. J. Kfoury , J. Tiuryn , P. Urzyczyn, An analysis of ML typability, Journal of the ACM (JACM), v.41 n.2, p.368-398, March 1994
	A. J. Kfoury , J. Tiuryn , P. Urzyczyn, A proper extension of ML with an effective type-assignment, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.58-69, January 10-13, 1988, San Diego, California, United States
	Rowan Davies , Frank Pfenning, A modal analysis of staged computation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.258-270, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Yves Bertot, Occurrences in debugger specifications, ACM SIGPLAN Notices, v.26 n.6, p.327-337, June 1991
	F. Tip , T. B. Dinesh, A slicing-based approach for locating type errors, ACM Transactions on Software Engineering and Methodology (TOSEM), v.10 n.1, p.5-55, Jan. 2001
	Konstantin Läfer , Martin Odersky, Polymorphic type inference and abstract data types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.5, p.1411-1430, Sept. 1994
	Zhong Shao, Flexible representation analysis, ACM SIGPLAN Notices, v.32 n.8, p.85-98, Aug. 1997
	Iliano Cervesato , Frank Pfenning, A linear logical framework, Information and Computation, v.179 n.1, p.19-75, November 25, 2002
	Mark P. Jones, Simplifying and improving qualified types, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.160-169, June 26-28, 1995, La Jolla, California, United States
	Tim Freeman , Frank Pfenning, Refinement types for ML, ACM SIGPLAN Notices, v.26 n.6, p.268-277, June 1991
	Rowan Davies , Frank Pfenning, A modal analysis of staged computation, Journal of the ACM (JACM), v.48 n.3, p.555-604, May 2001
	Matthias Neubauer , Peter Thiemann, Discriminative sum types locate the source of type errors, ACM SIGPLAN Notices, v.38 n.9, p.15-26, September 2003
	Tobias Nipkow , Christian Prehofer, Type checking type classes, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.409-418, March 1993, Charleston, South Carolina, United States
	Yasuhiko Minamide , Jacques Garrigue, On the runtime complexity of type-directed unboxing, ACM SIGPLAN Notices, v.34 n.1, p.1-12, Jan. 1999
	Brent Hailpern , Tien Huynh , Gyorgy Revesz, Comparing Two Functional Programming Systems, IEEE Transactions on Software Engineering, v.15 n.5, p.532-542, May 1989
	Chung-chieh Shan, Sexy types in action, ACM SIGPLAN Notices, v.39 n.5, May 2004
	Hanne Riis Nielson , Flemming Nielson, Flow logic: a multi-paradigmatic approach to static analysis, The essence of computation: complexity, analysis, transformation, Springer-Verlag New York, Inc., New York, NY, 2002
	Manuel M. T. Chakravarty , Gabriele Keller , Simon Peyton Jones, Associated type synonyms, ACM SIGPLAN Notices, v.40 n.9, September 2005
	Yves Bertot , Vladimir Komendantsky, Fixed point semantics and partial recursion in Coq, Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming, July 15-17, 2008, Valencia, Spain
	Robert Harper , Greg Morrisett, Compiling polymorphism using intensional type analysis, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.130-141, January 23-25, 1995, San Francisco, California, United States
	Francois Rouaix, Safe run-time overloading, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.355-366, December 1989, San Francisco, California, United States
	T. B. Dinesh , Frank Tip, A slicing-based approach for locating type errors, Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997, p.7-7, October 15-17, 1997, Santa Barbara, California
	Simon Peyton Jones , Dimitrios Vytiniotis , Stephanie Weirich , Mark Shields, Practical type inference for arbitrary-rank types, Journal of Functional Programming, v.17 n.1, p.1-82, January 2007
	Wolfgang Naraschewski , Tobias Nipkow, Type Inference Verified: Algorithm W in Isabelle/HOL, Journal of Automated Reasoning, v.23 n.3, p.299-318, November 1999
	Peter Thiemann, Combinators for program generation, Journal of Functional Programming, v.9 n.5, p.483-525, September 1999
	C. Calcagno , E. Moggi , T. Sheard, Closed types for a safe imperative MetaML, Journal of Functional Programming, v.13 n.3, p.545-571, May 2003

Collaborative Colleagues:

Dominique Clément: colleagues

Thierry Despeyroux: colleagues

Gilles Kahn: colleagues

Joëlle Despeyroux: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player