Loading...
Please wait, while we are loading the content...
Similar Documents
⊲ : d × list → list (2004).
| Content Provider | CiteSeerX |
|---|---|
| Author | Mathijssen, Aad |
| Abstract | We present solutions to exercises 2.5, 2.12 and 2.14 of [1]. In these solutions, we have chosen different names for the list operations than the ones that are proposed in [1], because these names were too operational. Additionally, the symmetry between pairs of operations is also expressed by their names. Exercise 2.5 In the following, an algebraic specification of a list on an arbitrary non-empty domain D is given. Lists are constructed using the operations empty list ( [ ] ) and cons (⊲), i.e. an element at the head of a list. Also we provide the operations snoc (⊳), i.e. an element at the tail of a list, left head (lhead), right head (rhead), left tail (ltail), right tail (rtail), the empty predicate (isempty), list length (#), and list concatenation (++). First, we define the sorts and operations. |
| File Format | |
| Publisher Date | 2004-01-01 |
| Access Restriction | Open |
| Subject Keyword | Present Solution Right Tail Algebraic Specification List Concatenation Empty Predicate Different Name List Length Arbitrary Non-empty Domain List List Operation Empty List Right Head List Operation |
| Content Type | Text |
