graph schema for capturing the structure of the dataset nodes, edges and properties in graph schema Know that a function, f, has a function type 4.12 4.12.1 type 4.12.1.1 f: A B (where the type is A B, A is the → → argument type, and B is the result type). Fundamentals Know that A is called the domain and B is called Functional Function the co-domain. Know that the domain and co-domain are always subsets of objects in some data type. Know that a function is a object in 4.12.1.2 programming functional programming languages and in imperative programming languages that support object of such objects. This means that it can be an functional argument to another function as well as the result of a function call. Know that function application means a function paradigm application Function 4.12.1.3 applied to its arguments. programming Know what is meant by partial function application function Partial 4.12.1.4 application for one, two and three argument functions and be able to use the notations shown opposite. Know what is meant by composition of functions. of Composition 4.12.1.5 functions Show experience of constructing simple programs functional 4.12.2 language 4.12.2.1 in a functional programming language. Higher-order functions. Writing Functional programs Have experience of using the following in a programs functional programming language: map filter reduce or fold Be familiar with representing a list as a programming 4.12.3 4.12.3.1 concatenation of a head and a tail. Know that the head is an element of a list and the tail is a list. Lists List Know that a list can be empty. processing Describe and apply the following operations: in return head of list functional return tail of list test for list return length of list construct an list
graph schema for capturing the structure of the dataset nodes, edges and properties in graph schema 4.12 Fundamentals of functional programming 4.12.1 Functional programming paradigm 4.12.1.1 Function type Know that a function, f, has a function type f: A → B (where the type is A → B, A is the argument type, and B is the result type). Know that A is called the domain and B is called the co-domain. Know that the domain and co-domain are always subsets of objects in some data type. 4.12.1.2 object Know that a function is a object in functional programming languages and in imperative programming languages that support such objects. This means that it can be an argument to another function as well as the result of a function call. 4.12.1.3 Function application Know that function application means a function applied to its arguments. 4.12.1.4 Partial function application Know what is meant by partial function application for one, two and three argument functions and be able to use the notations shown opposite. 4.12.1.5 Composition of functions Know what is meant by composition of functions. 4.12.2 Writing functional programs 4.12.2.1 Functional language programs Show experience of constructing simple programs in a functional programming language. Higher-order functions. Have experience of using the following in a functional programming language: map filter reduce or fold 4.12.3 Lists in functional programming 4.12.3.1 List processing Be familiar with representing a list as a concatenation of a head and a tail. Know that the head is an element of a list and the tail is a list. Know that a list can be empty. Describe and apply the following operations: return head of list return tail of list test for list return length of list construct an list