Geek Answers Handbook

How high should high-level languages ​​be?

I know that this is very abstract, but I believe that it is very focused.

Today, there are many high-level languages: C # , Java , VB , Python , etc. .., all created for abstract complexity at a low level and provide a more user-friendly programming experience. High-level languages ​​can reduce and in most cases completely eliminate the need to perform low-level, process-specific operations (such as pointer manipulation and memory management). Many also remove platform details (e.g., file manipulation, user interface creation, etc.).

My two questions are:

  • What else can / should be abstracted? Is there even lower level semantics present in today's high-level languages ​​that will / should be distracted further?
  • At what point does a high-level language of a high-level become very high-level , aka goal-oriented ?
+5
source share
8 answers

, , , . , , .

Java, , , ( , ) . Java. , Java Java, , , ( , ).

, D , . D , , D. . , , , , . , D, , , .

+4
  • / ?   . , , , ? .
  • , ?   / , , , .

, ... , , .

+4

"". Inform ( ), . :

The fireplace is scenery in the Entrance Hall. The description is "Unlit, vacant
[if Search is happening]. It is almost as though you are not expected[end if]."
The sound of the fireplace is "whistling wind". Understand "fire" or "whistling" 
or "wind" as the fireplace. Instead of burning the fireplace: say "There is no 
fuel prepared for a fire."

.:)

+2

, . () , . (, , .)

, , .

, , , , . //.

:

int32 Remainder(int32 numerator, int32 denominator) {
    requires denominator != 0
    ensures Math.Abs(result) < Math.Abs(denominator)
    ensures exists n suchthat n*denominator + result == numerator
}
int32 EuclideanRemainder(int32 numerator, int32 denominator) {
    requires denominator != 0
    ensures result >= 0
    ensures result < Math.Abs(denominator)
    ensures exists n suchthat n*denominator + result == numerator
}

:

//warning: suggested precondition: denominator != int32.MinValue due to Math.Abs
int32 Remainder(int32 numerator, int32 denominator) {
    return numerator % denominator;
}
int32 EuclideanRemainder(int32 numerator, int32 denominator) {
    return ((numerator % denominator) + denominator) % denominator;
}
+2

Hrm, , : Clojure STM Erlang Actor.

  • , , , , - concurrency, . , .
  • , , , .
+1

, - .

0
  • "" UAT ( , , , , , , Fit ); .
  • (.. ), (. GUI #, ++ MFC, ++ Win32 API).
  • , : - , OO # Java (, , , ...).
  • UML (?), UML viesw ; UML ( ).
  • IDE : , IDE, . - , , . .

, , .

0

More articles:


All Articles