Prototype Functional Language

A tiny functional language built as part of the COL226 Programming Languages course taught by Prof. Sanjiva Prasad at IIT Delhi in 2019

Assignments

• Assignment 0 - Arithmetic for arbitrarily large numbers

  • Defines a BIGINT package in OCaml for implementing arithmetic for arbitrarily large numbers, using lists of digits to represent an arbitrarily large number.

• Assignment 1 - A simple definitional interpreter and a stack machine

  • Models the "abstract syntax" of a simple calculator language and gives it "semantic meaning" in terms of OCaml's built-in types.
  • Implements a simple stack-based machine which accepts opcodes in Reverse Polish Notation (RPN) as input and evaluates them.
  • Implements a compiler to translate abstract syntax of an expression in the calculator language to opcodes in RPN that the stack-based machine can accept by doing post-order traversal of the expression's AST.

• Assignment 2 - Building a lexer using ocamllex

  • Extends the language with boolean values, if-then-else and variable bindings and implements a lexer for the language.

• Assignment 3 - Building a parser using ocamlyacc

  • Implements a parser for the language using ocamlyacc.

• Assignment 4 - Type Checker

  • Extends the language with tuples, definitions and function abstractions and implements a type checker for this language.

• Assignment 5 - Interpreters: Krivine and SECD Machine

  • Implements the Krivine Machine (Call by Name Interpreter) and SECD Machine (Call by Value Interpreter) for the defined functional language.

• Assignment 6 - A simulator for nested procedure calls

  • Implements a simulator for the call stack during nested procedure calls in order to understand implementations of static scoping in Algol-like languages, particularly visibility rules and the set-up/tear-down involved in a procedure call and return. Note: The actual call stack layout for a compiler and code generation are not implemented.