Searching for "Recursive monadic bindings." – sorted by Relevance.
-
Recursive Monadic Bindings
- applicability. Recursive Monadic Bindings Levent Erkok John Launchbury Oregon Graduate Institute of Science
- Cited by 35 (4 self) – Add To MetaCart
-
Recursive monadic bindings: Technical development and details
- Recursive Monadic Bindings: Technical Development and Details ∗ Levent Erkök John Launchbury
- Cited by 1 (0 self) – Add To MetaCart
-
A Recursive do for Haskell
- Abstract Certain programs making use of monads need to perform recursion over the values
- Cited by 8 (1 self) – Add To MetaCart
-
Mixin Modules and Computational Effects
- semantics is defined in terms of a Haskell-like recursive monadic binding. Since we mainly focus
- Cited by 13 (5 self) – Add To MetaCart
-
Recursion is a Computational Effect
- make the task of writing recursive monadic bindings much more convenient. Supported by National
- Cited by 7 (1 self) – Add To MetaCart
-
Value Recursion in Monadic Computations
- circuits using monads . . . . . . . . . . . 2 1.3 Recursive monadic bindings
- Cited by 6 (2 self) – Add To MetaCart
-
An Abstract Monadic Semantics for Value Recursion
- for recursive monadic binding (M.1) (X|µ, ρ, Mfix x.e, E) > (X, x|µ, ρ, e, E[Mfix x.�]) with x renamed to avoid
- Cited by 12 (4 self) – Add To MetaCart
-
Mixin modules, modules and extended value binding in a call-by-value setting
- of mutually recursive function definitions. In OCaml, there are two different binding constructs for recursive
- Cited by 2 (1 self) – Add To MetaCart
-
A Cumulative Monadic Metalanguage
- code) Steps for recursive (monadic) bindings (M.0) (X |µ, fix x.e, E) > (X |µ, e[x: fix x.e], E) (M.1
- Add To MetaCart

