Sophie: nip2-7.22.2-1.fc14.2 x86

nip2-7.22.2-1.fc14.2.x86_64.rpm

<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"  
  "http://www.w3.org/TR/html4/loose.dtd">  
<html > 
<head><title></title> 
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1"> 
<meta name="generator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)"> 
<meta name="originator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)"> 
<!-- 3,html --> 
<meta name="src" content="nipguide.tex"> 
<meta name="date" content="2010-06-30 13:34:00"> 
<link rel="stylesheet" type="text/css" href="nipguide.css"> 
</head><body 
>
      <div class="footnote-text">
  <!--l. 317--><p class="indent" >    <span class="footnote-mark"><a 
 id="fn1x6">    <sup class="textsuperscript">1</sup></a></span><span 
class="ptmr7t-x-x-80">Since programs are referentially transparent (that is, the value of an</span>
  <span 
class="ptmr7t-x-x-80">expression depends only upon its syntactic context, not upon computation</span>
  <span 
class="ptmr7t-x-x-80">history), you can easily do equational reasoning, proof by induction, and so</span>
  <span 
class="ptmr7t-x-x-80">on.</span>
  <!--l. 317--><p class="indent" >    <span 
class="ptmr7t-x-x-80">Expressions are like theorems, definitions are like axioms, computation</span>
  <span 
class="ptmr7t-x-x-80">is like proof.</span></div>
       
</body></html>