Every defition in C and C++ has a property known as linkage. A definition with external linkage is visible to and can be referenced by translation units other the one in which it appears. A definit...

What? Normally, when an object is created dynamically or statically, an allocation function is invoked in such a way that it will both allocate memory for the object and initalize the object withi...

Type Checking The process of verifying and enforcing the constraints of types—type checking—may occur either at compile time (a static check) or at run-time (a dynamic checking). If a language spe...

Macros: The Key Points Macros let the programmers to add their own synatactic sugar to the syntax of a language. A macro definition introduces some new syntax into the language. It describes ho...

Thunks Delay In Racket Language, any expression that we wrap with parenthesis can call itself with no argument. Since it’s not a special form (define, if, begin), it will be treated as a function....

Map (* Type of map: ('a -> 'b) * 'a list -> 'b list *) fun map (f,xs) = case xs of [] => [] |x::xs' => (f x)::map(f,xs') The map function takes a list and a function f and produc...

One of the characteristic features of functional programming is recursion concept. Recursions are not suppose to be harder than using loops. Actually often much easier than loop: When processin...

A programming language should categorize its variables into some types at some point during the life cycle of a program. We can categorize the types into two as base types and compound types. Progr...

Essential “pieces” necessary for defining and learning any programming language: Syntax: How do you write the various parts of the language? Semantics: What do the various language features m...

Expressions And Variable Bindings in ML An ML program is a sequence of bindings. Each bindings gets type-checked and then (assuming it type-checks) evaluated. Let’s consider variable binding now:...