Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83; site cstvax.UUCP Path: utzoo!linus!philabs!cmcl2!seismo!mcvax!ukc!cstvax!db From: db@cstvax.UUCP (Dave Berry) Newsgroups: net.lang Subject: Re: Type-System Questions Message-ID: <6@cstvax.UUCP> Date: Mon, 28-Oct-85 09:12:08 EST Article-I.D.: cstvax.6 Posted: Mon Oct 28 09:12:08 1985 Date-Received: Fri, 1-Nov-85 01:32:01 EST References: <15100005@ada-uts.UUCP> Reply-To: db@cstvax.UUCP (Dave Berry) Organization: Comp. Sc., Edinburgh Univ., Scotland Lines: 18 In article <15100005@ada-uts.UUCP> richw@ada-uts.UUCP writes: >Does anyone know of any languages that either: >1) Attempts to do compile-time type-checking via "type inference"? ML is a strongly-typed functional language with type inference. See "A proposal for Standard ML" by Robin Milner in the 1984 LISP conference. The language is older than that, but has just been standardised. It includes abstract datatypes, higher-order functions & polymorphism. You can define your own infix operators, and updatable values are provided if you need them. There's also a variant called lazy ML. The original paper detailing the inference scheme is "A theory of type polymorphism in programming", by Robin Milner in the Journal of Computer & System Sciences 17 (1978) pp 348-375. -- Dave Berry. CS postgrad, Univ. of Edinburgh ...mcvax!ukc!cstvax!db