ngernest Goto Github PK

01-basics

02-higherorder

03-trees

04-classes

05-quickcheck

06-persistent

07-gadts

08-monads

09-state

10-parsers

11-transformers

academicpages.github.io

Github Pages template for academic personal websites, forked from mmistakes/minimal-mistakes

articheck

base

Standard library for OCaml

bolt

Bolt is a language with in-built data-race freedom!

book

V2 of Real World OCaml

church-rossser

Proof of the Church-Rosser theorem using locally nameless representation in Coq

ci-demo

A repo showing off GitHub Actions

cis6700_lc_encodings

Materials for a lecture on λ calculus encodings (CIS 6700, Spring 2023)

cs242-f19

Stanford's CS 242 PL course (Fall 2019)

dc-demo

defunc

"Defunctionalization at Work" (Danvy & Nielsen 2001)

docker-demo

drp_fall_2020

Independent Study on Polya's Random Walk Theorem for Lattice Graphs and Electric Network Theory

effect-handler-tutorial

Concurrent Programming with Effect Handlers

higher-rank-type-inference

Implementation of the Hindley-Damas-Milner type inference algorithm (described in the "Practical type inference for arbitrary-rank types" paper)

metalib

The Penn Locally Nameless Metatheory Library

mica

Automated Differential Testing for OCaml Modules

model_quickcheck

Model_quickcheck: Model-based testing for imperative OCaml code

modmod

A modular module system by Xavier Leroy