• Homework 1 due week of September 26, 2005
  ASU 4.39, 4.40, 4.44
  Answers

• Homework 2 due by October 7, 2005
  ASU 5.8 a,b
  Answers
  For practice, write the following Prolog programs:

  • A program that given a list checks if it is a palindrome; that is, palin(X) returns yes when X is a list that is a palindrome and no otherwise. A palindrome is a word that is the same when read forwards and backwards, such as mom or madam. For our purposes, let's consider sequences of symbols or numbers to be considered palindromes. For example, [1,2,2,1] and [a,b,c,b,a] are palindromes whereas [1,2,3,1] and [a,b,c,b] are not.
    Answer
    

  • Think of representing a set as Prolog list. Write a Prolog program that calculates the intersection of 2 sets and the union of two sets (Be careful: these are sets, not multisets, so you can not just use append to accomplish the union.) Recall that the way to approach this problem is to decompose each task into subtasks and write rules to accomplish each subtask, finally composing them together.
    Answer
    

    You may wish to consult the Prolog handout for help debugging your programs.

• Homework 3 due by October 24, 2005
  Types homework
  Answer1 Answer2
  

• Homework 4 due by November 14, 2005
  Lambda calculus homework
  Answer
  small SML problems
  Answer
  

• Homework 5 Due by November 28, 2005
  Complete Homework 4 lambda calculus problems 3+4
  Complete some SML type problems
  Lambda calculus answers
  SML answers
  

• Homework 5 Due by December 12, 2005
  OOPLs homework
  Answer 1, Answer 2

Last updated by Barbara Ryder at 9:20pm on December 14, 2005.