From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-0.9 required=5.0 tests=BAYES_00,FORGED_GMAIL_RCVD,
	FREEMAIL_FROM autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: 103376,b076e6315fd62dc5
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Received: by 10.204.152.217 with SMTP id h25mr353531bkw.3.1336878676185;
        Sat, 12 May 2012 20:11:16 -0700 (PDT)
Path: 
 h15ni1964bkw.0!nntp.google.com!news2.google.com!goblin2!goblin.stu.neva.ru!aioe.org!.POSTED!not-for-mail
From: NatarovVI <4KCheshireCat@gmail.com>
Newsgroups: comp.lang.ada
Subject: Re: fyi, very interesting Ada paper OOP vs. Readability
Date: Sun, 13 May 2012 03:11:12 +0000 (UTC)
Organization: Aioe.org NNTP Server
Message-ID: <jon8og$5o1$1@speranza.aioe.org>
References: <jodq5f$j5f$1@speranza.aioe.org>
	<johvef$cgg$1@speranza.aioe.org>
	<1ir29foizbqv1.v9uuhpykjl3n.dlg@40tude.net>
	<joifa0$e9f$1@speranza.aioe.org>
	<18ct9oamzq1u1$.wh6hj9mlqxna$.dlg@40tude.net>
NNTP-Posting-Host: TNf0rmM5b4cIzEdXORLLAg.user.speranza.aioe.org
Mime-Version: 1.0
X-Complaints-To: abuse@aioe.org
User-Agent: Pan/0.135 (Tomorrow I'll Wake Up and Scald Myself with Tea; GIT
	30dc37b master)
X-Notice: Filtered by postfilter v. 0.8.2
Content-Type: text/plain; charset=KOI8-R
Content-Transfer-Encoding: 8bit
Date: 2012-05-13T03:11:12+00:00
List-Id: <comp.lang.ada>

> the only purpose of any computing is side-effects. (:-))

nope. result is purpose. functional programming just
orders that things. it make result "written" in one place.
this result may be "state of world".
so... side-effects is just "undocumented" results.

in the modern parallel world, functional way better than imperative.
because data flows in parallel program will be clearer and more
deterministic.

>> For example, I use Mathematica, and in Mathematica, there is no data
>> types.  Only expressions. There are transformation rules to transform
>> an expression from one form to another.

this is only Mathematica problem, not FP problem.
you perfectly can have and expressions and types.
And check youself by types. look at Standard ML.

Ada has own goods. but process of their "modernisation" brokes
some of this goods. Gnat monopoly is bad.
Ada no more looks like clock mechanic, where any part is in their place((
Language get overcomplicated, because language developers
is changed. It's too young and have small wisdom yet.
instead of introducing simple predictable generally applicable
mechanic, they add many many corner cases.

is Ada+ML can be simplified to some reliable parallelisable language?
what if they modernise Ada packages in spirit of ML module sublanguage...
and send oop to trash.