7. (a) Prove that ab.ab uv.

uv (Use ) (5 Marks)
(b)
Prove
that
if
xFV(M)
then
FV([N/x])=FV(N)(FV(M)-{x}) (Give a general proof) (5 Marks)

PART-A
Answer all the questions

5 X 4 = 20 Marks

8. (a) Find the length of the term xK(IIx)(2 Marks)

(b)Does Ix occur in K(xS)((xSab)(Ix))? Why? What
are the free variables in the given CL term? (4 Marks)
(c)Compute:

1. (a) Is (z(y.(y.y))) a term? Why? Is it encouraged in practice? Why? (2 Marks)

(b)Insert
full
parantheses
and
s
into
(ab.ac(bc))pqr (2 Marks)

(a) [(IK)/y]yabyx (2 Marks)

2. (a)Does x.x occur in yx.x? Why? (2 Marks)

(b)Write the scope of the variables involved in the
expression ab(p.pq)c (2 Marks)

(b) [SK/x]([(KI)/y]yxy) (2 Marks)

*****

3. (a)Evaluate [(a.va/b)](a(v.bv)). (2 Marks)

(b)Prove that reduction of (a.(b.ba)c)d is cd (2
Marks)

PART-A
Answer all the questions

4. (a)Prove that if P=y.y(uvw.w) and Q=(z.z)

then prove that neither P, Q has a -nf but PQ has
a -nf. (2 Marks)
(b) Prove that if P, Q -nf and P= Q then P Q.
(2 Marks)(Give a general proof. Dont prove by taking an example)

5 X 4 = 20 Marks

1. Define B=S(KS)K. Prove that Bxyz.w x(yz) for all

terms x,y and z.
2. Define primitive recursive function.
3. Construct truth table for (p q) p

5. (a) Express the following combinators in symbolic

form: B, B,K and W (2 Marks)
(b)What do you know about the scope of all variables
in CL terms? Why? (2 Marks)

4. Analyze the satisfiability of A = p (q p)

5. Distinguish implode and explode functions. Give an
example.
PART-B

PART-B
Answer all the questions
Answer all the questions
Marks

3 X 10 = 30 Marks

3 X 10 = 30
6. (a) State and prove fixed point theorem. (5)
(b) Prove that the Predecessor function is primitive
recursive. (5)

6. State and Prove Church Rosser theorem for = .

1

7. (a) A set of literals is satisfiable if and only if it

does not contain a complementary pair of literals (5
Marks)
(b) Construct the semantic tableau for B = (p q)
( p q) (5 Marks)
8. (a) Find the hd(tl[1,2,3,4]) and tl(hd[1,2,3,4]) (2)
(b)Explain global definition in SML with and example. (3)
(c)Write a recursive function(SML) to compute the
factorial of an integer.(5)
*****