Programming Languages · Control Conditionals Functions function calls Threads Data Scalars: booleans, numbers, strings Records/ structures Classes, types sept.8.2003 16.41016.413 Intro. to scheme Scheme A language for describing computational processes Precise sequence of steps used to infer new information from a set of data Governed by rules for: 1. Syntax: Legal expressions have rules by which they are constructed from simpler pieces 2. Semantics:(Almost)every expression has a value which is "returned"when an expression is evaluated 3. Every value has a type. sept.8,2003 16.41016.413 Intro. to schemeProgramming Languages • Control – Conditionals – Loops – Functions, function calls – Exceptions – Threads • Data – Scalars: booleans, numbers, strings – Records / Structures – Classes, types Sept. 8, 2003 16.410/16.413 Intro. to Scheme 3 / 4 Scheme A language for describing computational processes: – Governed by rules for: expression has a value, 1. Syntax: Legal expressions have rules by which they are constructed from simpler pieces. 2. Semantics “evaluated”. 3. Every value has a Sept. 8, 2003 16.410 16.413 Intro. to Scheme Precise sequence of steps used to infer new information from a set of data. : (Almost) every which is “returned” when an expression is type. 2