https://github.com/dhil/generic-count
implementing generic count using undelimited continuations, delimited continuations, and effect handlers
https://github.com/dhil/generic-count
callcc effect-handlers generic-count generic-search shift-reset
Last synced: 11 months ago
JSON representation
implementing generic count using undelimited continuations, delimited continuations, and effect handlers
- Host: GitHub
- URL: https://github.com/dhil/generic-count
- Owner: dhil
- License: apache-2.0
- Created: 2023-07-03T08:43:41.000Z (almost 3 years ago)
- Default Branch: master
- Last Pushed: 2023-07-03T13:14:45.000Z (almost 3 years ago)
- Last Synced: 2025-06-14T06:35:24.928Z (about 1 year ago)
- Topics: callcc, effect-handlers, generic-count, generic-search, shift-reset
- Language: OCaml
- Homepage:
- Size: 13.7 KB
- Stars: 5
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Implementations of generic count with first-class control
This repository contains code associated with the following papers:
* [Effects for Efficiency: Asymptotic Speedup with First-Class Control](https://dl.acm.org/doi/pdf/10.1145/3408982), published in ICFP 2020.
* [Asymptotic Speedup with Effect Handlers](https://dhil.net/research/papers/asympeff-jfp2023-draft.pdf), under consideration for publication in JFP, 2023.
Note that the code in this repository is not part of the companion
artifact code published along side the papers. See the papers for
details on their artifacts.
The code in this repository illustrates different implementations of
the generic count problem using delimited continuations (shift/reset),
undelimited continuations (callcc) and state, and effect handlers.