90 lines
6.4 KiB
HTML
90 lines
6.4 KiB
HTML
<html>
|
|
<head>
|
|
<!-- Generated by the Spirit (http://spirit.sf.net) QuickDoc -->
|
|
<title>Basic Concepts</title>
|
|
<link rel="stylesheet" href="theme/style.css" type="text/css">
|
|
<link rel="prev" href="quick_start.html">
|
|
<link rel="next" href="architecture.html">
|
|
</head>
|
|
<body>
|
|
<table width="100%" height="48" border="0" background="theme/bkd2.gif" cellspacing="2">
|
|
<tr>
|
|
<td width="10">
|
|
</td>
|
|
<td width="85%">
|
|
<font size="6" face="Verdana, Arial, Helvetica, sans-serif"><b>Basic Concepts</b></font>
|
|
</td>
|
|
<td width="112"><a href="http://spirit.sf.net"><img src="theme/spirit.gif" align="right" border="0"></a></td>
|
|
</tr>
|
|
</table>
|
|
<br>
|
|
<table border="0">
|
|
<tr>
|
|
<td width="30"><a href="../index.html"><img src="theme/u_arr.gif" border="0"></a></td>
|
|
<td width="30"><a href="quick_start.html"><img src="theme/l_arr.gif" border="0"></a></td>
|
|
<td width="20"><a href="architecture.html"><img src="theme/r_arr.gif" border="0"></a></td>
|
|
</tr>
|
|
</table>
|
|
<p>
|
|
Everything is a function (class actor) in the Phoenix framework that can be evaluated as f(a..n), where n is the function's arity, or number of arguments that the function expects. Operators are also functions. For example, a + b is just a function with arity == 2 (or binary). a + b is the same as plus(a, b), a + b + c is the same as plus(plus(a, b), c). plus(plus(a, b), c) is a ternary function (arity == 3).</p>
|
|
<p>
|
|
Amusingly, even functions return functions. We shall see what this means in a short while.</p>
|
|
<p>
|
|
Currying, named after the famous Logician <a href="http://www.haskell.org">
|
|
Haskell</a> Curry, is one of the important mechanisms in the programming discipline known as functional programming (or FP). There's much theory surrounding the concepts behind it, however, in the most simplest term, it is safe to assume that "currying" a function is more or less like partially evaluating a function. Take a simple pseudo C++ function:</p>
|
|
<code><pre>
|
|
<span class=identifier>plus</span><span class=special>(</span><span class=identifier>x</span><span class=special>, </span><span class=identifier>y</span><span class=special>) { </span><span class=keyword>return </span><span class=identifier>x </span><span class=special>+ </span><span class=identifier>y</span><span class=special>; }
|
|
</span></pre></code>
|
|
<p>
|
|
for example. Fully evaluating the function 'plus' above is done by supplying the arguments for x and y. For example:</p>
|
|
<code><pre>
|
|
<span class=identifier>plus</span><span class=special>(</span><span class=number>3</span><span class=special>, </span><span class=number>2</span><span class=special>)
|
|
</span></pre></code>
|
|
<p>
|
|
will give us 5. On the other hand, partial evaluation can be thought of as calling the function without supplying all the arguments. Here's an imaginary (non-C++) example:</p>
|
|
<code><pre>
|
|
<span class=identifier>plus</span><span class=special>(?, </span><span class=number>6</span><span class=special>)
|
|
</span></pre></code>
|
|
<p>
|
|
What does this mean and what is the function's result? First, the question mark proclaims that we don't have this argument yet, let this be supplied later. We have the second argument though, which is 6. Now, while the fully evaluated function plus(3, 2) results to the actual computed value 5, the partially evaluated function plus(?, 6) results to another (unnamed) function (A higher order function. In FP, the unnamed function is called a lambda function), this time, the lambda function expects one less argument:</p>
|
|
<code><pre>
|
|
<span class=identifier>plus</span><span class=special>(</span><span class=number>3</span><span class=special>, </span><span class=number>2</span><span class=special>) --> </span><span class=number>5
|
|
</span><span class=identifier>plus</span><span class=special>(?, </span><span class=number>6</span><span class=special>) --> </span><span class=identifier>unnamed_f_x_plus_6</span><span class=special>(</span><span class=identifier>x</span><span class=special>)
|
|
</span></pre></code>
|
|
<p>
|
|
now, we can use unnamed_f_x_plus_6, which is the result of the expression plus(?, 6) just like a function with one argument. Thus:</p>
|
|
<code><pre>
|
|
<span class=identifier>plus</span><span class=special>(?, </span><span class=number>6</span><span class=special>)(</span><span class=number>3</span><span class=special>) --> </span><span class=number>9
|
|
</span></pre></code>
|
|
<p>
|
|
This can be understood as:</p>
|
|
<code><pre>
|
|
<span class=special>| </span><span class=identifier>plus</span><span class=special>(?, </span><span class=number>6</span><span class=special>) | (</span><span class=number>3</span><span class=special>) |
|
|
|</span><span class=identifier>_____f1_____</span><span class=special>| |
|
|
|</span><span class=identifier>_____f2___________</span><span class=special>|
|
|
</span></pre></code>
|
|
<ul><li>f1 is the result of partially evaluating plus(?, 6)</li><li>f2 is the result of the fully evaluated function passing 3 where f1 has the ? placeholder, thus plus(3, 6)</li></ul><p>
|
|
The same can be done with operators. For instance, the above example is equivalent to:</p>
|
|
<code><pre>
|
|
<span class=number>3 </span><span class=special>+ </span><span class=number>2 </span><span class=special>--> </span><span class=number>5
|
|
</span><span class=special>? + </span><span class=number>6 </span><span class=special>--> </span><span class=identifier>unnamed_f_x_plus_6</span><span class=special>(</span><span class=identifier>x</span><span class=special>)
|
|
</span></pre></code>
|
|
<p>
|
|
Obviously, partially evaluating the plus function as we see above cannot be done directly in C++ where we are expected to supply all the arguments that a function expects. Simply, currying the function plus is not possible in straight C++. That's where the Phoenix framework comes in. The framework provides the facilities to do partial function evaluation.</p>
|
|
<table border="0">
|
|
<tr>
|
|
<td width="30"><a href="../index.html"><img src="theme/u_arr.gif" border="0"></a></td>
|
|
<td width="30"><a href="quick_start.html"><img src="theme/l_arr.gif" border="0"></a></td>
|
|
<td width="20"><a href="architecture.html"><img src="theme/r_arr.gif" border="0"></a></td>
|
|
</tr>
|
|
</table>
|
|
<br>
|
|
<hr size="1">
|
|
<p class="copyright">Copyright © 2001-2002 Joel de Guzman<br>
|
|
<br>
|
|
<font size="2">Use, modification and distribution is subject to the Boost Software
|
|
License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
|
http://www.boost.org/LICENSE_1_0.txt) </font> </p>
|
|
</body>
|
|
</html>
|