- CM.hs: an implementation of Danvy-Filinski’s shift and reset as a delimited continuation indexed monad (based on Atkey’s “Parameterised Notions of Computation”).
- df.rkt: a redex model of Danvy-Filisnki’s shift and reset type system with answer type changing (broken I think).
- callcc.rkt: a redex model of “delimited callcc”, based on Racket’s behavior (this actually found a bug in Racket lol).
-
Notifications
You must be signed in to change notification settings - Fork 0
maxsnew/delim-cont-toys
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Haskell, Redex Models of (Delimited) Continuations
Resources
Stars
Watchers
Forks
Releases
No releases published