Sometimes we have to repeat ourselves before we are heard. Then again there are times where we have to perform a certain action the same way several times before we can carry on with what we want to do.

Repetition is the keyword here and for humans that is something we generally try to avoid. Yet our digital friends love repetition. They never get tired and they never get bored of doing the same thing over and over again countless times.

So it’s little wonder then that all modern programming languages give us various ways in which we can perform a certain action as many times as we need.

In python we have the for statement which gives us the power to loop over large collections of data very quickly and efficiently.

F# is excellent for specialties such as scientific computing and data analysis. It is an excellent choice for enterprise development as well. There are a few great reasons why you should consider using F# for your next project.

Concise

F# is not cluttered up with coding noise;  no pesky semicolons, curly brackets, and so on. You almost never have to specify the kind of object you're referencing because of its powerful type inference system. It usually takes fewer lines of code to solve the same issue.

Convenient

Common programming tasks are much easier in F#. These include generating and using state machines, comparison and equality, list processing, as well as complex type definitions. It is very easy to generate powerful and reusable code because functions are first class objects. This is done by creating functions that have other functions as parameters or that combine existing functions to generate a new functionality.

Correctness

F# has a strong type system, and, therefore, prevents many common errors such as null reference exceptions. Valuables are immutable by default which, too, prevents a huge class of errors. You can also encode business logic by utilizing the type system. When done correctly, it is impossible to mix up units of measure or to write incorrect code thereby decresing the need of unit tests.

Concurrency

F# has number of built-in libraries. These libraries help when more than one thing at a time is occurring. Parallelism and asynchronous programming are very simple. There is also a built-in actor model as well as excellent support for event handling and functional reactive programming. Sharing state and avoiding locks are much easier because data structures are immutable by default.

Completeness

F# also supports other styles that are not 100 percent pure. This makes it easier to interact with the non-pure world of databases, websites, other applications, and so on. It is actually designed as a hybrid functional/OO language. F# is also part of the .NET ecosystem. This gives you seamless access to all the third party .NET tools and libraries. It operates on most platforms. These platforms include Linux and smartphones via mono. Visual Studio is integrates with F# as well. This means you get many plug-ins for unit tests, a debugger, a IDE with IntelliSense support, other development tasks. You can use MonoDevelop IDE on Linux.

Related:

F# - Marching Towards Top 10 Programming Languages

What Are the Advantages of Python Over Ruby?

Top 10 Programming Languages Expected To Be In Demand in 2014

As developers we are overwhelmed with the number of language choices made available to us. It wasn't so long ago that C and it's object oriented sibling C++ where the mainstay of any programmer. Now though we have languages which make certain tasks so easy and simple that we simply cannot afford to ignore them.

In this article we are going to look at the overall differences between Python, Perl and TCL. All formidable and worthy in their own right, but each one has been designed to suit a specific programming need.

1)– Perl is the most mature out of the three languages we are looking at in this article. It was originally designed for processing textual data, and it does so extremely well. Of course Perl has grown over time and can be used for a multitude of different programming scenarios.

I will begin our blog on Java Tutorial with an incredibly important aspect of java development:  memory management.  The importance of this topic should not be minimized as an application's performance and footprint size are at stake.

From the outset, the Java Virtual Machine (JVM) manages memory via a mechanism known as Garbage Collection (GC).  The Garbage collector

• Manages the heap memory.   All obects are stored on the heap; therefore, all objects are managed.  The keyword, new, allocates the requisite memory to instantiate an object and places the newly allocated memory on the heap.  This object is marked as live until it is no longer being reference.
• Deallocates or reclaims those objects that are no longer being referened. 
• Traditionally, employs a Mark and Sweep algorithm.  In the mark phase, the collector identifies which objects are still alive.  The sweep phase identifies objects that are no longer alive.
• Deallocates the memory of objects that are not marked as live.
• Is automatically run by the JVM and not explicitely called by the Java developer.  Unlike languages such as C++, the Java developer has no explict control over memory management.
• Does not manage the stack.  Local primitive types and local object references are not managed by the GC.

So if the Java developer has no control over memory management, why even worry about the GC?  It turns out that memory management is an integral part of an application's performance, all things being equal.  The more memory that is required for the application to run, the greater the likelihood that computational efficiency suffers. To that end, the developer has to take into account the amount of memory being allocated when writing code.  This translates into the amount of heap memory being consumed.

Memory is split into two types:  stack and heap.  Stack memory is memory set aside for a thread of execution e.g. a function.  When a function is called, a block of memory is reserved for those variables local to the function, provided that they are either a type of Java primitive or an object reference.  Upon runtime completion of the function call, the reserved memory block is now available for the next thread of execution.  Heap memory, on the otherhand, is dynamically allocated.  That is, there is no set pattern for allocating or deallocating this memory.  Therefore, keeping track or managing this type of memory is a complicated process. In Java, such memory is allocated when instantiating an object:

String s = new String();  // new operator being employed
String m = "A String";    /* object instantiated by the JVM and then being set to a value.  The JVM
calls the new operator */