Skip to content

Latest commit

 

History

History
60 lines (39 loc) · 2.65 KB

Readme.md

File metadata and controls

60 lines (39 loc) · 2.65 KB
Raw

oh camel!

Programs written in OCaml / Prolog for the IIT D Course COL 765 - "Introduction to Logic & Functional Programming" taught by Sanjiva Prasad.

If you're looking for Class Notes. Here is a PDF.

List of Assignments

  1. Sets using Lists (scored 10/10)
  2. Propositions and Conversion to CNF etc. (scored 9/10)
  3. Natural Deduction Proof Trees (scored 9/10)
  4. Terms (on a signature) and Substitutions (scored 7.5/10)
  5. Propositional Resolution via Backtracking (scored 10/10)
  6. Prolog Interpreter in OCaml (scored 3/10)
  7. Type Checker in Prolog (scored 7/10)

Bugs

I did not get full marks in all assignments, so the code is not fully correct. Some of the issues I remember are:

  • Assignment 2:

    • Tautology / Contradiction functions were failing in some cases.

  • Assignment 3:

    • normalise has some issues, so one of the trees from the TA's test cases was not getting normalised correctly.

  • Assignment 4:

    • Some edge case in check_sig
    • Some edge case in mgu
    • Height of a constant (Node("a", [])) should've been 0 not 1.
    • Didn't know what was meant by "efficient substitution"

  • Assignment 6:

    • No support for prolog lists so append() function couldn't be created
    • No support for X \= Y etc operators
    • Infinite recursion in many test cases
    • The values being printed were not resolved properly

  • Assignment 7:

    • The Or Elimination (case(E0, E1, E2)) was wrong
      • It should take inl(X), inr(Y) as parameters

Other repositories

This repo by a '2015 student was quite helpful (especially in the 2nd assignment).

There's not much prior code for this course on the web, but Sanjiva Sir also teaches a course on "Programming Languages" in which he once gave a Prolog Interpreter assignment so GitHub has a ton of other examples for this. This is the one I took help from.

Here is another repository by one of my classmates (so it'll have same assignments).

Beware of MOSS

MOSS is a tool that can detect similarity in code and it works on OCaml. So If you're copying code from here, do remember to make sufficient changes and be prepared to get a fail grade if you are caught.

You can also register for the MOSS service so you can check your similarity score before submitting the assignment. You should aim at keeping the score below 20.

Support

If you're having trouble understanding some part of the code, feel free to open an issue.