package higher
Library for higher-kinded programming
Install
Dune Dependency
Authors
Maintainers
Sources
0.3.0.tar.gz
sha256=f95cea485caef6f4bb20886e14e0173e23ecd8fdc96887b35c72f1c09e6d2af3
md5=01d66c410421f105efcbaa1561a71afc
Description
Published: 10 Dec 2015
README
README.md
The code in this directory is taken from the paper "Lightweight Higher-Kinded Polymorphism" (Jeremy Yallop and Leo White). The following examples are available:
typed defunctionalization (Section 1.2)
folds over perfect trees (Section 2.1)
Leibniz equality (Section 2.2)
the codensity transform (Section 2.3)
kind polymorphism (Section 2.4)
Most of the code depends on the higher library, which you can install using opam. Once higher is installed you can load the examples into the top level directly:
$ ocaml
OCaml version 4.01.0
# #use "topfind";;
[...]
# #require "higher";;
[...]
# #use "example-1-perfect-trees.ml";;
type 'a perfect = Zero of 'a | Succ of ('a * 'a) perfect
[...]
#
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page