http://www-2.cs.cmu.edu/~rwh/theses/okasaki.pdf

目次。 Introduction The fold operator The universal property of fold Universality as a proof principle The fusion property of fold Universality as a definition principle Increasing the power of fold: generating tuples Primitive recursion U…

目次。 Introduction The data type of lists Catamorphisms Anamorphisms Hylomorphisms Paramorphisms Algebraic data types Functors Recursive types Recursion Schemes Program Calculation Laws Catamorphisms Anamorphisms Hylomorphisms Relating ca…

目次。 Introduction λ-calculus From terms to nets Interaction net reduction From nets to terms Static correctness Directed nets Tree nets The automaton Reading back trees Binding loops λ-nets △≅▲ Dynamic correctness Related and further wor…

目次。 Introduction Multiple Return Values Implementation Rewriting values and call-with-values Procedure call interface Register-based return count Stack-based return count Separate multiple-value return point Procedural versions of value…

目次。 Introduction Scheme as an IntermediateRepresentation What is an IR? An Introduction to Scheme Why Scheme? CurrentScheme Implementations Scheme Speed Scheme Architecture Advantageous Scheme Semantics Scoping First-class Procedures Co…