comp.lang.ada
 help / color / mirror / Atom feed
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: discriminant questions
Date: Fri, 30 Sep 2011 20:55:31 +0200
Date: 2011-09-30T20:55:31+02:00	[thread overview]
Message-ID: <d6ti2aj99zk6$.8duslzj9hdes$.dlg@40tude.net> (raw)
In-Reply-To: 4e85fef2$0$6548$9b4e6d93@newsspool4.arcor-online.net

On Fri, 30 Sep 2011 19:40:01 +0200, Georg Bauhaus wrote:

> On 30.09.11 14:38, Dmitry A. Kazakov wrote:
>> On Fri, 30 Sep 2011 12:07:53 +0200, Georg Bauhaus wrote:
>> 
>>> Whether or not programmers should be able to correctly manipulate
>>> language features.
>> 
>> They should not. 
> 
> So that's a no.
> 
> Then:
> 
>>> Should a language like Prolog be defined such that (...)
>>> replace the backtracking implementation with one of their own?
> 
>> Yes, if Prolog designers wished it survive... but they didn't.
> 
> And that's a yes.
> 
> Can the contradiction be resolved?

There is no contradiction. It is like Ada storage pools, by providing a
custom storage pool you don't manipulate language features.

>> I bet that practically no program uses the number -435167342. Is it not
>> general purpose?
> 
> It is not, if no purpose can be specified, and I suppose that
> few language standards talk about the number -435167342.
> (Maybe the telephone directory of Eckernf�rde does :-)
> Numeric types will more likely match general purpose.

That has implications, once you add an integer type you must provide
-435167342 with it. In fact, 435167342 is an integral part of Ada syntax
(as a literal, all possible literals are).

>>> I'll also prefer "task" to mean something that Ada programmers would
>>> recognize.
>> 
>> As something, which is not a task?
>> 
>> I don't understand what you are trying to say. Task is fundamental to
>> concurrent computing, they cannot be expressed in any other terms.
> 
> The notion of Ada tasks is a composite notion.

No, Ada tasks is a possible implementation of abstract task. The components
of Ada tasks are as composite as the components of Ada subprograms, Ada
gotos etc.

> ...  Hence, seen as a notion, a task is not atomic.

That does not follow. In order to show it you have to demonstrate how to
implement a task without using tasks.

> Typical facilities of an Ada task can be built from other primitives
> of concurrent programming, if one were to do this in another language.

There is no such primitives. The corresponding OS primitives (e.g. threads)
or ones of the Ada RTL, are already tasks, albeit non-Ada tasks.

> Since the Ada notion of task incorporates many facilities
> that can be taken for granted, I call tasks heavy, in this
> sense.

This definition of "heavy" makes no sense.

> Since we have protected objects, sometimes qualified to be
> light weight, there must have been another notion of "heavy"
> associated with task. (I.e., in another sense.)

The protected object has no less "facilities" than the task.

The light weight of protected object refer to its application to certain
concurrency problems under certain machine architectures *in addition* to
tasks. These very problems can be solved without protected objects using
tasks only. The opposite is wrong: no concurrency problem can be solved by
protected objects alone without tasks (and interrupts, which is a special
case of task).
 
>>> Plus: 4) compiler making business requirements,
>> Irrelevant.
> Practically, compiler making business is rather decisive.
> Just look at who is active on behalf of the ARG; Google is paying
> ... for Python, Go ...,  MS is paying ... for language research
> (including standardized languages like C++ or Javascript), the
> WGs being  staffed by ...

So? Do you sincerely believe the result depends on who pays? Commercial
languages are equally poor, because the market of languages is
dysfunctional, dead.

>> Anyway, you didn't answer which category is supposed to decide what is
>> "heavy".
> 
> People from all of the categories try to move decisions in certain
> directions.

People here have different influence. There is no consensus on what is
"heavy", so your model just does not work.

>>> or tries to be minimal in some sense.
>> 
>> This applies to *any* language.
> 
> Being minimal applies to any language only if one trivializes
> "minimal in some sense", which is a trap. The "some sense"
> part is the interesting part.

See above. 

>>> Alternatively, the customer/programmer can just have
>>> a Prolog shop make an implementation the meets their special requirements.
>> 
>> See above. It didn't work in 60s,
> 
> It works for some of the Ada business now, if I'm not mistaken.

You are. There is no competing Ada clones. Deviations are considered as
flaws not as special features. Would by buy a DVD burner that produces
unreadable DVDs? Anybody prefer, maybe, suboptimal, but most compatible and
versatile product.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de



  reply	other threads:[~2011-09-30 18:55 UTC|newest]

Thread overview: 89+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2011-09-17 16:30 discriminant questions ytomino
2011-09-17 17:19 ` Dmitry A. Kazakov
2011-09-17 17:46   ` ytomino
2011-09-17 19:41     ` Dmitry A. Kazakov
2011-09-17 22:55       ` ytomino
2011-09-18  8:50         ` Dmitry A. Kazakov
2011-09-18 10:54           ` ytomino
2011-09-18 11:35             ` Dmitry A. Kazakov
2011-09-18 12:41               ` ytomino
2011-09-18 13:17                 ` Dmitry A. Kazakov
2011-09-18 16:22                   ` ytomino
2011-09-18 16:32                   ` ytomino
2011-09-18 18:15                     ` Dmitry A. Kazakov
2011-09-18 23:44                       ` ytomino
2011-09-19  7:27                         ` Dmitry A. Kazakov
2011-09-18 14:43               ` Dmitry A. Kazakov
2011-09-18 16:46               ` Robert A Duff
2011-09-18 18:01                 ` Dmitry A. Kazakov
2011-09-18 19:20                   ` Maciej Sobczak
2011-09-19  7:39                     ` Dmitry A. Kazakov
2011-09-19 20:00                       ` Maciej Sobczak
2011-09-20  7:33                         ` Dmitry A. Kazakov
2011-09-20 15:45                           ` Maciej Sobczak
2011-09-20 16:48                             ` Dmitry A. Kazakov
2011-09-20 20:19                               ` Maciej Sobczak
2011-09-21  7:48                                 ` Dmitry A. Kazakov
2011-09-21 20:51                                   ` Maciej Sobczak
2011-09-22  8:07                                     ` Dmitry A. Kazakov
2011-09-22 20:57                                       ` Maciej Sobczak
2011-09-23  7:59                                         ` Dmitry A. Kazakov
2011-09-23 10:57                                           ` Georg Bauhaus
2011-09-23 22:30                                           ` Randy Brukardt
2011-09-23 22:50                                           ` Randy Brukardt
2011-09-24  6:46                                             ` Dmitry A. Kazakov
2011-09-26 22:48                                               ` Randy Brukardt
2011-09-27  8:10                                                 ` Dmitry A. Kazakov
2011-09-27 10:18                                                   ` Georg Bauhaus
2011-09-27 12:14                                                     ` Dmitry A. Kazakov
2011-09-27 15:11                                                       ` Georg Bauhaus
2011-09-27 15:38                                                         ` Dmitry A. Kazakov
2011-09-27 18:06                                                           ` Georg Bauhaus
2011-09-27 19:06                                                             ` Dmitry A. Kazakov
2011-09-29  0:01                                                               ` Georg Bauhaus
2011-09-29  8:26                                                                 ` Dmitry A. Kazakov
2011-09-30  1:24                                                                   ` Randy Brukardt
2011-09-30  8:10                                                                     ` Dmitry A. Kazakov
2011-09-30 10:07                                                                   ` Georg Bauhaus
2011-09-30 12:38                                                                     ` Dmitry A. Kazakov
2011-09-30 17:40                                                                       ` Georg Bauhaus
2011-09-30 18:55                                                                         ` Dmitry A. Kazakov [this message]
2011-09-23  9:23                                       ` Stephen Leake
2011-09-23  9:48                                         ` Dmitry A. Kazakov
2011-09-23 22:42                                           ` Randy Brukardt
2011-09-24  6:56                                             ` Dmitry A. Kazakov
2011-09-26 22:43                                               ` Randy Brukardt
2011-09-24 10:47                                             ` Stephen Leake
2011-09-24 12:54                                       ` Simon Wright
2011-09-24 14:46                                         ` Dmitry A. Kazakov
2011-09-24 16:21                                           ` Simon Wright
2011-09-24 16:43                                             ` Dmitry A. Kazakov
2011-09-22  2:52                                   ` Randy Brukardt
2011-09-22  8:11                                     ` Dmitry A. Kazakov
2011-09-20  0:01           ` Randy Brukardt
2011-09-20  7:38             ` Dmitry A. Kazakov
2011-09-20 11:11               ` AdaMagica
2011-09-20 12:09                 ` Dmitry A. Kazakov
2011-09-20 12:31                   ` AdaMagica
2011-09-20 12:57                     ` Dmitry A. Kazakov
2011-09-20 23:28                       ` ytomino
2011-09-21  5:03                         ` AdaMagica
2011-09-21  8:08                         ` Dmitry A. Kazakov
2011-09-21 10:03                           ` Georg Bauhaus
2011-09-21 10:29                             ` Dmitry A. Kazakov
2011-09-22  3:21                           ` Randy Brukardt
2011-09-22  3:05                   ` Randy Brukardt
2011-09-19 23:35         ` Randy Brukardt
2011-09-20 21:39           ` ytomino
2011-09-22  3:32             ` Randy Brukardt
2011-09-18 16:32 ` ytomino
2011-09-19 14:46   ` ytomino
2011-09-19 15:14     ` Dmitry A. Kazakov
2011-09-19 17:49       ` ytomino
2011-09-20  7:29         ` Georg Bauhaus
2011-09-20 19:50           ` ytomino
2011-09-20  8:08         ` Dmitry A. Kazakov
2011-09-20 18:47           ` ytomino
2011-09-21  8:16             ` Dmitry A. Kazakov
2011-09-21  9:55               ` ytomino
2011-09-22  3:26                 ` Randy Brukardt
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox