Each element can be an atom, a structure, or another list. Atoms are simple values such as numbers, symbols, booleans, that cannot be further decomposed into simpler parts. Welcome to DrScheme, version 103. Welcome to DrScheme, version 103. Representing Polynomials with Lists and Structures A polynomial in one variable can be represented as a list of coefficients.
Every term is represented by an explicit coefficient.
Simple to add two polynomials in this representation. In functional programming, recursion is a natural expression building tool. A recursive procedure definition includes an expression that applies the procedure being defined. The recursive application will normally be applied to simpler or otherwise modified arguments from the original arguments. Recursive procedure definitions must also include base cases that require no further recursion Recursive definitions are often shorter and clearer than the equivalent imperative form.