A Turing complete language 😉

A pseudo-3D pursuit and racing game made using SFML C++

Optimal approximate sampling from discrete probability distributions

IITH BTECH CSE all Courses' Codes and Assignments

An interpreter for the recursive language (POPL course).

Bubble sorts a list in ascending order.

An interpreter for the functional language (POPL course).

Implementing operations on list using functional calls such as map, foldl, apply ...

Functional Programming on Trees.

Is a variable free in a lambda expression (see EOPL)?

Wraps parentheses around each top-level element of lst (see EOPL).

An interpreter for the lexical language (POPL course).

Returns #t if any element of lst satisfies pred, #f otherwise (see EOPL).

Returns a list containing n copies of x (see EOPL).

An arithmetic lang interpreter in Haskell (POPL course).

Use the recursive definition of list to find its length (see EOPL).

A basic number expression language compiler (POPL + compilers course).

Increments only the first value of list.

Writing subst following original kleene star grammar using map (see EOPL).

Returns a list of elements sorted in ascending order (see EOPL).