]]>Only accept as input terms coming from your own language.

]]>Only accept as input terms coming from your own language.

What I had been learning in my Programming Language course, however, was that I really could manage my own control flow if I wanted. Furthermore, I could start with a simpler, more naive program and basically DERIVE the sophisticated one through a series of correctness-preserving program transformations.

Rest of the

]]>What I had been learning in my Programming Language course, however, was that I really could manage my own control flow if I wanted. Furthermore, I could start with a simpler, more naive program and basically DERIVE the sophisticated one through a series of correctness-preserving program transformations.

Rest of the story here.

]]>"The walking skeleton is to test-drive the initial architecture."

(S. Freeman, N. Pryce)

]]>"The walking skeleton is to test-drive the initial architecture."

(S. Freeman, N. Pryce)

]]>Constructors that fail when called without new are a potential problem, and three solutions we can use are, respectively, auto-instantiation, overloading the constructor, or killing such calls with fire.

Here's the rest of the article.

]]>Constructors that fail when called without new are a potential problem, and three solutions we can use are, respectively, auto-instantiation, overloading the constructor, or killing such calls with fire.

Here's the rest of the article.

]]>`begin`

lookalike in ES6, we can take advantage of the fact that in JavaScript arguments are evaluated from left to right. This leads to:
```
const begin = (...args) => args[args.length - 1];
```

We can therefore replicate SICP's `make-withdraw`

procedure as:

`const makeWithdraw = bal =>`

]]>`begin`

lookalike in ES6, we can take advantage of the fact that in JavaScript arguments are evaluated from left to right. This leads to:
```
const begin = (...args) => args[args.length - 1];
```

We can therefore replicate SICP's `make-withdraw`

procedure as:

```
const makeWithdraw = bal =>
amount => bal >= amount ? begin(bal = bal - amount, bal)
: "Insufficient founds"
```

]]>`let`

expressions, such as
```
(let ((x 3) (y 5)) (+ x y))
```

is to use ES6 default parameters:

```
((x = 3, y = 5) => x + y)()
```

It is possible to go one step further by defining an auxiliary `let_`

function as:

`const let_ = f => f(`

]]>`let`

expressions, such as
```
(let ((x 3) (y 5)) (+ x y))
```

is to use ES6 default parameters:

```
((x = 3, y = 5) => x + y)()
```

It is possible to go one step further by defining an auxiliary `let_`

function as:

```
const let_ = f => f();
```

This allows rewriting the previous function application as:

```
let_((x = 3, y = 5) => x + y);
```

Definitely not the most idiomatic thing to do, though :-)

]]>"Unit tests prove that a solution works in a particular way, rather than asserting that it solves a particular problem."

(J. Humble et al.)

]]>"Unit tests prove that a solution works in a particular way, rather than asserting that it solves a particular problem."

(J. Humble et al.)

]]>"Pascal and C are special-purpose languages for manipulating the registers and memory."

(P. Norvig)

]]>"Pascal and C are special-purpose languages for manipulating the registers and memory."

(P. Norvig)

]]>"We do not develop the domain. The domain is some realm of know-how of the business we are working in. What we design and implement is a model of a domain."

(V. Vernon)

]]>"We do not develop the domain. The domain is some realm of know-how of the business we are working in. What we design and implement is a model of a domain."

(V. Vernon)

]]>"Naming is perhaps the most powerful abstracting notion we have, in any language, for it allows any complex to be reduced for linguistic purposes to a primitive atom."

(G. L. Steele Jr.)

]]>"Naming is perhaps the most powerful abstracting notion we have, in any language, for it allows any complex to be reduced for linguistic purposes to a primitive atom."

(G. L. Steele Jr.)

]]>"Mathematical induction proves that we can climb as high as we like on a ladder, by proving that we can climb onto the bottom rung (the basis) and that from each rung we can climb up to the next one (the induction)."

(Concrete Mathematics 2nd ed.)

]]>"Mathematical induction proves that we can climb as high as we like on a ladder, by proving that we can climb onto the bottom rung (the basis) and that from each rung we can climb up to the next one (the induction)."

(Concrete Mathematics 2nd ed.)

]]>"If we look at mathematics, it has been greatly driven by overloading. Extensions of a notion of numbers from natural numbers to integers, to rational numbers, to Gaussian integers, to p-adic numbers, etc., are examples of overloading. One can easily guess things without knowing exact definitions. If I see an

]]>"If we look at mathematics, it has been greatly driven by overloading. Extensions of a notion of numbers from natural numbers to integers, to rational numbers, to Gaussian integers, to p-adic numbers, etc., are examples of overloading. One can easily guess things without knowing exact definitions. If I see an expression that uses both addition and
multiplication, I assume distributivity. If I see less-than and addition, I assume that if `a < b`

then `a + c < b + c`

(I seldom add uncountable cardinals).

**Overloading allows us to carry knowledge from one type to another.**"

(A. Stepanov)

]]>"When dealing with "creational" use cases, try to find another aggregate or factory you can move that responsibility to. Sometimes the factory is just a static method (good for "context"/"intent" capturing), sometimes it's an instance method of another aggregate (good place for "data" inheritance), sometimes it's an explicit factory

]]>"When dealing with "creational" use cases, try to find another aggregate or factory you can move that responsibility to. Sometimes the factory is just a static method (good for "context"/"intent" capturing), sometimes it's an instance method of another aggregate (good place for "data" inheritance), sometimes it's an explicit factory object (good place for "complex" creation logic)."

]]>The goal of this tutorial is to provide enough knowledge and ability on Scheme programming language to read SICP, which is one of the best text book on computer science. The book uses Scheme to explain subjects.

]]>The goal of this tutorial is to provide enough knowledge and ability on Scheme programming language to read SICP, which is one of the best text book on computer science. The book uses Scheme to explain subjects.

]]>