From ML to program proof or: The continuation of functional programming by other means Xavier Leroy INRIA Paris-Rocquencourt Milner symposium,

First Page		Document Content
Date: 2012-10-10 03:52:03 Software engineering Programming language theory Type theory Computing ML Type inference Polymorphism Type system Type class HindleyMilner type system Ad hoc polymorphism OCaml		From ML to program proof or: The continuation of functional programming by other means Xavier Leroy INRIA Paris-Rocquencourt Milner symposium, Add to Reading List Source URL: events.inf.ed.ac.uk Download Document from Source Website File Size: 1,18 MB Share Document on Facebook

	From ML to program proof or: The continuation of functional programming by other means Xavier Leroy INRIA Paris-Rocquencourt Milner symposium, DocID: 1reTA - View Document
	How to make ad-hoc polymorphism less ad hoc Philip Wadler and Stephen Blott University of Glasgow OctoberAbstract DocID: 1q0rF - View Document
	Evaluating the dynamic behavior of Smalltalk applications Bachelor Thesis Roger Stebler from Balsthal, Switzerland DocID: 18wHT - View Document
	Contextual Polymorphism by Glen Jerey Ditcheld A thesis DocID: 10tpQ - View Document
	Modular implicits Leo White Fr´ed´eric Bour A common criticism of OCaml is its lack of support for ad-hoc polymorphism. The classic example of this is OCaml’s separate addition operators for integers (+) and floatin DocID: WQxP - View Document