Mercurial > cpdt > repo

comparison src/Intro.v @ 371:f7c2bf7f1324

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
The one rule of dependent pattern matching
author Adam Chlipala <adam@chlipala.net>
date Fri, 02 Mar 2012 10:52:22 -0500
parents 549d604c3d16
children 31fa03bc0f18
comparison
equal deleted inserted replaced
370:549d604c3d16 371:f7c2bf7f1324
135 (** * Prerequisites *) 135 (** * Prerequisites *)
136 136
137 (** 137 (**
138 I try to keep the required background knowledge to a minimum in this book. I will assume familiarity with the material from usual discrete math and logic courses taken by undergraduate computer science majors, and I will assume that readers have significant experience programming in one of the ML dialects, in Haskell, or in some other, closely related language. Experience with only dynamically typed functional languages might lead to befuddlement in some places, but a reader who has come to understand Scheme deeply will probably be fine. 138 I try to keep the required background knowledge to a minimum in this book. I will assume familiarity with the material from usual discrete math and logic courses taken by undergraduate computer science majors, and I will assume that readers have significant experience programming in one of the ML dialects, in Haskell, or in some other, closely related language. Experience with only dynamically typed functional languages might lead to befuddlement in some places, but a reader who has come to understand Scheme deeply will probably be fine.
139 139
140 My background is in programming languages, formal semantics, and program verification. I sometimes use examples from that domain, As a reference on these topics, I recommend %\emph{%#<i>#Types and Programming Languages#</i>#%}~\cite{TAPL}%, by Benjamin C. Pierce; however, I have tried to choose examples so that they may be understood without background in semantics. 140 My background is in programming languages, formal semantics, and program verification. I sometimes use examples from that domain. As a reference on these topics, I recommend %\emph{%#<i>#Types and Programming Languages#</i>#%}~\cite{TAPL}%, by Benjamin C. Pierce; however, I have tried to choose examples so that they may be understood without background in semantics.
141 *) 141 *)
142 142
143 143
144 (** * Using This Book *) 144 (** * Using This Book *)
145 145