1  Building Abstractions with Procedures
    1.1  The Elements of Programming
        1.1.1  Expressions
        1.1.2  Naming and the Environment
        1.1.3  Evaluating Combinations
        1.1.4  Compound Procedures
        1.1.5  The Substitution Model for Procedure Application
        1.1.6  Conditional Expressions and Predicates
        1.1.7  Example: Square Roots by Newton's Method
        1.1.8  Procedures as Black-Box Abstractions
    1.2  Procedures and the Processes They Generate
        1.2.1  Linear Recursion and Iteration
        1.2.2  Tree Recursion
        1.2.3  Orders of Growth
        1.2.4  Exponentiation
        1.2.5  Greatest Common Divisors
        1.2.6  Example: Testing for Primality
    1.3  Formulating Abstractions with Higher-Order Procedures
        1.3.1  Procedures as Arguments
        1.3.2  Constructing Procedures Using Lambda
        1.3.3  Procedures as General Methods
        1.3.4  Procedures as Returned Values
 
2  Building Abstractions with Data
    2.1  Introduction to Data Abstraction
        2.1.1  Example: Arithmetic Operations for Rational Numbers
        2.1.2  Abstraction Barriers
        2.1.3  What Is Meant by Data?
        2.1.4  Extended Exercise: Interval Arithmetic
    2.2  Hierarchical Data and the Closure Property
        2.2.1  Representing Sequences
        2.2.2  Hierarchical Structures
        2.2.3  Sequences as Conventional Interfaces
        2.2.4  Example: A Picture Language
    2.3  Symbolic Data
        2.3.1  Quotation
        2.3.2  Example: Symbolic Differentiation
        2.3.3  Example: Representing Sets
        2.3.4  Example: Huffman Encoding Trees
    2.4  Multiple Representations for Abstract Data
        2.4.1  Representations for Complex Numbers
        2.4.2  Tagged data
        2.4.3  Data-Directed Programming and Additivity
    2.5  Systems with Generic Operations
        2.5.1  Generic Arithmetic Operations
        2.5.2  Combining Data of Different Types
        2.5.3  Example: Symbolic Algebra
 
3  Modularity, Objects, and State
    3.1  Assignment and Local State
        3.1.1  Local State Variables
        3.1.2  The Benefits of Introducing Assignment
        3.1.3  The Costs of Introducing Assignment
    3.2  The Environment Model of Evaluation
        3.2.1  The Rules for Evaluation
        3.2.2  Applying Simple Procedures
        3.2.3  Frames as the Repository of Local State
        3.2.4  Internal Definitions
    3.3  Modeling with Mutable Data
        3.3.1  Mutable List Structure
        3.3.2  Representing Queues
        3.3.3  Representing Tables
        3.3.4  A Simulator for Digital Circuits
        3.3.5  Propagation of Constraints
    3.4  Concurrency: Time Is of the Essence
        3.4.1  The Nature of Time in Concurrent Systems
        3.4.2  Mechanisms for Controlling Concurrency
    3.5  Streams
        3.5.1  Streams Are Delayed Lists
        3.5.2  Infinite Streams
        3.5.3  Exploiting the Stream Paradigm
        3.5.4  Streams and Delayed Evaluation
        3.5.5  Modularity of Functional Programs and Modularity of Objects
 
4  Metalinguistic Abstraction
    4.1  The Metacircular Evaluator
        4.1.1  The Core of the Evaluator
        4.1.2  Representing Expressions
        4.1.3  Evaluator Data Structures
        4.1.4  Running the Evaluator as a Program
        4.1.5  Data as Programs
        4.1.6  Internal Definitions
        4.1.7  Separating Syntactic Analysis from Execution
    4.2  Variations on a Scheme -- Lazy Evaluation
        4.2.1  Normal Order and Applicative Order
        4.2.2  An Interpreter with Lazy Evaluation
        4.2.3  Streams as Lazy Lists
    4.3  Variations on a Scheme -- Nondeterministic Computing
        4.3.1  Amb and Search
        4.3.2  Examples of Nondeterministic Programs
        4.3.3  Implementing the Amb Evaluator
    4.4  Logic Programming
        4.4.1  Deductive Information Retrieval
        4.4.2  How the Query System Works
        4.4.3  Is Logic Programming Mathematical Logic?
        4.4.4  Implementing the Query System
 
5  Computing with Register Machines
    5.1  Designing Register Machines
        5.1.1  A Language for Describing Register Machines
        5.1.2  Abstraction in Machine Design
        5.1.3  Subroutines
        5.1.4  Using a Stack to Implement Recursion
        5.1.5  Instruction Summary
    5.2  A Register-Machine Simulator
        5.2.1  The Machine Model
        5.2.2  The Assembler
        5.2.3  Generating Execution Procedures for Instructions
        5.2.4  Monitoring Machine Performance
    5.3  Storage Allocation and Garbage Collection
        5.3.1  Memory as Vectors
        5.3.2  Maintaining the Illusion of Infinite Memory
    5.4  The Explicit-Control Evaluator
        5.4.1  The Core of the Explicit-Control Evaluator
        5.4.2  Sequence Evaluation and Tail Recursion
        5.4.3  Conditionals, Assignments, and Definitions
        5.4.4  Running the Evaluator
    5.5  Compilation
        5.5.1  Structure of the Compiler
        5.5.2  Compiling Expressions
        5.5.3  Compiling Combinations
        5.5.4  Combining Instruction Sequences
        5.5.5  An Example of Compiled Code
        5.5.6  Lexical Addressing
        5.5.7  Interfacing Compiled Code to the Evaluator

//--------------------------------------------
// URLのパラメータをハッシュとして取得する
//--------------------------------------------
<script>
function getQueryString () {
    var retVal = new Array();
 
    // 「?」以降のパラメータ部を取得する
    var searchStr = window.location.search;
    if ( searchStr == "" ) {
        alert( "no params" );
        return;
    }
 
    // 各パラメータに分割する
    var params = searchStr.substring( 1 ).split( "&" );
 
    // 分割した全パラメータをハッシュに登録する
    for ( var i = 0; i < params.length; i++ ) {
        // パラメータのkey,valueを取得する
        keyValue = params[i].split( "=" );
 
        // ハッシュに値を登録する
        if ( keyValue.length == 1 ) {
            retVal[ keyValue[0] ] = "";
        } else {
            retVal[ keyValue[0] ] = keyValue[1];
        }
    }
 
    // 登録されたハッシュを返す
    return retVal;
}
</script>

<input id="btnInput" type="button" value="表示" />
<script type="text/javascript" src="http://ajax.googleapis.com/ajax/libs/jquery/1.7.1/jquery.min.js">
</script>
<script>
$(document).ready(function(){
    // 入力ボタンがクリックされたときのハンドラ
    $("#btnInput").click(function() {
        params = getQueryString();
        for( var key in params ) {
            alert( "key[" + key + "] -> [" + params[key] + "]"  );
        }
    });
});
</script>

html

<html></html>

html:xml

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="ja"></html>

html:5

<!DOCTYPE HTML>
<html lang="ja-JP">
    <head>
        <meta charset="UTF-8" />
        <title></title>
    </head>
    <body></body>
</html>

meta:utf

<meta http-equiv="Content-Type" content="text/html;charset=UTF-8" />

link:css

<link rel="stylesheet" type="text/css" href=".css" />

script

<script type="text/javascript"></script>

script:src

<script type="text/javascript" src=""></script>

h2

<h2></h2>

a

<a href=""></a>

#head

<div id="head"></div>

.head

<div class="head"></div>

p#head

<p id="head"></p>

p#head.large.left

<p id="head" class="large left"></p>

table tr td

<table>
    <tr>
        <td></td>
    </tr>
</table>

ul li*3

<ul>
    <li></li>
    <li></li>
    <li></li>
</ul>

ul li&

<ul>
    <li></li>
</ul>

dl (dt+dd)*2

<dl>
    <dt></dt>
    <dd></dd>
    <dt></dt>
    <dd></dd>
</dl>

a:[href=foo.com]

<a href="foo.com"></a>

table+

<table>
    <tr>
        <td></td>
    </tr>
</table>

"form:get ( 
input:text#txtMail + 
input:btn#btnSet
)"

<form action="">
<input type="text" name="" value="" id="txtMail" />
<input type="" name="" value="" id="btnSet" />
</form>

<div style="margin:-10px;padding-bottom:20px;">
    <script language="javascript" type="text/javascript" src="http://b.hatena.ne.jp/js/widget.js" charset="utf-8"></script>
    <script defer language="javascript" type="text/javascript">
    Hatena.BookmarkWidget.url   = "http://nanoappli.com";
    Hatena.BookmarkWidget.title = "人気の記事";  // タイトル
    Hatena.BookmarkWidget.sort  = "count";       // hot:新着エントリー count:人気エントリー
    Hatena.BookmarkWidget.width = 280;           // パーツの横幅
    Hatena.BookmarkWidget.num   = 5;             // 表示するエントリー数
    Hatena.BookmarkWidget.theme = "default";
    Hatena.BookmarkWidget.load();
    </script>
</div>

 
<style type="text/css">
<!--
/* タイトル一覧の背景を透明にする */
.hatena-bookmark-widget-title, .hatena-bookmark-widget-title a {
  background-color: #F9F9F9        !important;
  border-bottom: 0px               !important;
  background-image: none           !important;
  font-size: 12px    !important;
  font-weight: bold  !important;
  color:#333333      !important;
  border-radius: 0 0;
  -moz-border-radius: 0 0;
  -webkit-border-radius: 0 0;
}
/* 記事一覧の背景を透明にする */
.hatena-bookmark-widget-body ul {
  background-color: transparent !important;
}
/* 記事一覧のタイトル文字の装飾を変更する */
.hatena-bookmark-widget ul li a.hatena-bookmark-entrytitle {
    color: #333333;
    text-decoration: underline;
}
 
/* 記事一覧のタイトル下部にある線を消す */
.hatena-bookmark-widget ul li {
	border-bottom: 0px !important;
}
-->
</style>