CS 3304  Home  Syllabus  Grades  Related Links E-Mail Contacts  E-Mail Instructor  E-Mail TA  E-Mail Listserv  Listserv Archive Course Notes  Contents  Search  Topics  Keyword Index Languages  Pascal  Scheme  Prolog  Standard ML Programs  Dates/Guidelines  Submit Program  Program 1 (2/19)  Program 2 (3/19)  Program 3 (4/2)  Program 4 (4/30) Homework  Dates/Guidelines  HW #1 (1/24)  HW #2 (1/31)  HW #3 (2/07)  HW #4 (2/14)  HW #5 (2/21)  HW #6 (2/28)  HW #7 (3/23)  HW #8 (3/30)  HW #9 (4/06)  HW #10 (4/13)  HW #11 (4/20)  HW #12 (5/2)  HW #13 (5/2)			30 Points Due: 5/02/01 at the start of class Complete each of the following problems: Write your own implementation of the prolog predicate maplist (look it up in the SWI-Prolog manual to see what it does). Since maplist is built-in, call yours my_maplist. You cannot use the built-in maplist in your implementation. [Hint: you can use apply. You may also want to try the next problem first. ] Write a Scheme implementation of maplist that takes two parameters: a function, and a list. Its return value should be the list of results produced by calling the function on each item of the list in turn. You may not use any of the Scheme versions of map, for-each, or reduce in your solution.