A Turing complete language 😉

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

let a million languages bloom

Optimal approximate sampling from discrete probability distributions

IITH BTECH CSE all Courses' Codes and Assignments

POPL 2025 conference notes and materials. Focus on AI systems, WebAssembly, and verification.

Bubble sorts a list in ascending order.

An interpreter for the recursive language (POPL course).

Returns cartesian product of sos1 with sos2 (see EOPL).

Functional Programming on Trees.

An interpreter for the lexical language (POPL course).

An interpreter for the functional language (POPL course).

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

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

Assignments done as a part of the course Principles of Programming Languages (CS350A)

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

An interpreter for the arithmetic language (POPL course).

Mark each element of list as a pair of its index and value (see EOPL).

Notes of Paradigms of Programming Languages

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

An arithmetic lang interpreter in Haskell (POPL course).

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

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

Elimiate one call to subst-sexp in subst by replacing its definition (see EOPL).

Returns list of symbols in slist in the same order (see EOPL).

Get nth element of list so that it produces a more informative error message (see EOPL).

Returns list with n-th element replaced by x (see EOPL).

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

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

Get a new list with elements in the same order, except the the first occurrence of symbol s (see EOPL).