Abstract krivine machine implementing call-by-name semantics. In OCaml.
-
Updated
Apr 8, 2018 - OCaml
Abstract krivine machine implementing call-by-name semantics. In OCaml.
A Simple Toy language made in Prolog and OCaml
The code in this repository is relevant to the assignments given in the course COL226, taught by Prof. Sanjiva Prasad, in IIT Delhi, 2nd semester, 2017-2018.
Course assignments of COL226:- Programming Languages course at IIT Delhi under Professor Sanjiva Prasad
Implementation of abstract machines in Ocaml
An implementation of Krivine Machine that introduced by the "A Core Quantitative Coeffect Calculus".
This repository consists of various assignments given by Prof. Sanjiva in the COL226 course.
Consists of a Functional language as well as an Imperative language, implemented using Ocaml
Designed and Implemented Krivine and SECD machine that executes Call By Name and Call By Value semantics respectively.
Add a description, image, and links to the krivine-machine topic page so that developers can more easily learn about it.
To associate your repository with the krivine-machine topic, visit your repo's landing page and select "manage topics."