5.1. Main Texts🔗

There is no single text for the course. Material will be drawn from several online resources.

LEAN

TODO

EOPL

Essentials of Programming Languages 3rd Edition. Friedman and Wand. This is the main text for the course. Available on Amazon.in. Copies on reserve in the library.

HtDP

How to Design Programs. Felleisen et al. Available online. Uses Racket exclusively.

Mapcode book

An introduction to mathematical computer science. Kasturi Viswanath. Copies available on reserve at the library.

TRaAT

Term Rewriting and All That. Baader and Nipkow. Chapters 1 and 2. Chapter copies on reserve in the library.

5.2. Related Texts🔗

SICP

Structure and Interpretation of Programs. Abelson and Sussman. Available online. Accompanying video lectures also available online.

PLAI

Programming Languages: Application and Interpretation 2nd Edition. Shriram Krishnamurti. Available online.

SSICS

Simply Scheme: Introducing Computer Science. Brian Harvey and Matthew Wright. Available online.

RG

Racket Guide. Available as part of Racket language documentation.

5.3. Reading Resources & Tools🔗

The following resources are recommended for functional programming and theorem proving components:

6.1. Grades Breakup🔗

6.2. Late Submission Policy🔗

7.1. Collaboration and Resource Policy🔗

You are encouraged to discuss the course material and the homework and its solutions with your classmates. After consulting with your friends and online resources, however, you are expected to implement the homework solutions on your own.

When collaborating with your classmates in projects, please ensure that you properly credit your fellow contributors.

7.2. Generative AI Policy🔗

The use of Generative AI tools (such as ChatGPT, GitHub Copilot, Claude, etc.) is permitted under the following guidelines. To ensure academic integrity, this policy is strictly enforced through verifiable mechanisms:

• Allowed Assistance: You may use AI tools to explain programming language concepts, debug syntax errors, understand Lean 4 compiler errors, or brainstorm algorithms.

• Prohibited Direct Copying: Directly copying and submitting AI-generated code as your own work is prohibited.

• Verification through Live Defense (Vivas): Course grading includes mandatory and random oral examinations (vivas) conducted by the TAs or Instructor. During the viva:

  1. You will be asked to explain the logic, semantics, and design choices of specific parts of your submitted code.

  2. You will be asked to perform a minor live modification or extension to your code (e.g., changing a recursive function definition or adding a simple rule) to demonstrate practical understanding. Failure to explain your code or perform the live modification will result in a grade of zero for the assignment and referral for disciplinary action.

• Verification through Version Control (Git): All submissions must be accompanied by a logical Git commit history on GitLab Classroom. Submissions containing only a single monolithic commit of completed code without developmental history will be automatically flagged for audit and mandatory viva defense.

• Attribution-Friendly Submissions: If you use a generative AI tool to write, refactor, or structure any portion of your code, you must explicitly attribute it. Honest, clear attribution of AI assistance is treated as a valid academic citation rather than cheating, provided you include a header comment in your submission containing:

  1. The specific tool used (e.g., Claude 3.5 Sonnet).

  2. The prompt(s) used to generate the code.

  3. The exact parts of the code generated or inspired by the AI, and how you modified or integrated them. Note that even with proper attribution, you must still fully understand the code and pass the Live Defense checks to receive credit.

7.3. Penalties for Unfair Means🔗

Homeworks

If you are caught adopting unfair means in doing homeworks, you will receive a zero for that homework and all previous homeworks.

Quizzes

If you are caught adopting unfair means in a quiz, you will receive a zero for that quiz and all previous quizzes.