CSC/ECE 517 Fall 2011/ch1 1d sr: Difference between revisions

From Expertiza_Wiki
Jump to navigation Jump to search
Line 28: Line 28:


===Closures in Dynamically Typed Languages===
===Closures in Dynamically Typed Languages===
The programming language which does majority of its type-checking at run-time instead of compile-time is called as a dynamically typed language [http://en.wikipedia.org/wiki/Dynamic_typing#Dynamic_typing]. In dynamic typing, values have types but variables do not. Hence a variable can refer to a value of any type. This important property of dynamically typed languages offers itself as a convenient way of implementing and supporting closures. A variable will point to a block of code and the associated lexical environment.
====Example use of Closures in Dynamically Typed Langauges====
====Example use of Closures in Dynamically Typed Langauges====
=====Example in Ruby=====
=====Example in Ruby=====

Revision as of 17:10, 5 September 2011

Wiki Chapter: CSC/ECE 517 Fall 2011/ch1 1d sr

Introduction

Closures

What are Closures

Let us define what a closure as a programming construct means.

A Closure is basically a function or a method (or a block, in the context of ruby) that has the following two properties -

  • One can pass it around like an object or as a value parameter to other functions/methods/blocks
  • It takes the snapshot and effectively "remembers" the values of all the variables that were in scope when the function was created and it is because of this property that it is able to access those variables when it is called even though they may no longer be in scope. [1]

In order for a programming language to be able to support closures, it must support the notion of "first class functions." A first class function can be treated like an object in that you can pass it around as parameter or you can store it in collections. [2] Since a closure can be passed around as a value before calling it, it can be called in a completely different scope than the one in which it was created and it is because of this that it needs to retain the knowledge of the lexical environment in which it was defined. [3]

Let us articulate in detail what "saving a lexical environment of its definition" means when it comes to a closure. This is required because the ability of a language to provide "props" for saving lexical context of a function definition determines the level of difficulty and effectively feasibility of implementing closures in languages that do not support closures directly viz. the Statically Typed Languages like C, C++, Java. One way of doing this would be to make a copy of all the variables that are needed when a closure was defined. Alternatively, the lifetime of such variables can be extended not by explicitly copying them but by retaining a reference to them, thus making them not eligible for garbage collection. [4]

Why Closures

  • For Functional languages [5], which themselves are essentially stateless, closures offer a way to store some kind of state at least for as long as the closure lives.
  • Closures help functional languages to be terse in expressing logic. Closures also offer a very succinct way of performing some neat programmatic operations viz. if a closure modifies the value of a variable, it will retain the new value the next time the closure was invoked.
  • Higher order, special purpose functions like select, inject in Ruby, which do a lot of useful stuff with very little code are possible only because the language supports closures.
  • Currying of functions in languages like Ruby is only made possible through the use of closures.
  • For procedural or imperative languages, the argument for closures is a twofold one. Procedural languages already have mechanism to store state via the use of global variables, static variables etc. but closures offer a way to pass around units of computation that can be executed later. The function pointers and the callback function ideology in C is centered around this motivation. For object-oriented imperative languages like C++ or the Objective-C, closures provide for the lack of a syntactically light-weight way to define simple object functions for the effective use of several generic algorithms like those offered by Standard Template Library.

Closures in Dynamically Typed Languages

The programming language which does majority of its type-checking at run-time instead of compile-time is called as a dynamically typed language [6]. In dynamic typing, values have types but variables do not. Hence a variable can refer to a value of any type. This important property of dynamically typed languages offers itself as a convenient way of implementing and supporting closures. A variable will point to a block of code and the associated lexical environment.

Example use of Closures in Dynamically Typed Langauges

Example in Ruby
Example in JS
Example in Python

Closures in Statically Typed Languages

The Problem

Limitations of Statically Typed Languages

Lexical Scope

Functions not as first class citizens of the language

Implementing Closures in Statically Typed Languages

C : function pointers

C++ : function objects

Java : anonymous inner classes

Closures and Static Scoping

(Explanation)

Case study of Scheme

References

1. Matz discussion on Closures

2. Closures in C++

3. Closures in C

4. Closures in Java

External Links

1

2

3

4

5

6

7

8

9