Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '94 1994
DOI: 10.1145/174675.178047
|View full text |Cite
|
Sign up to set email alerts
|

Representing monads

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
228
0

Year Published

1997
1997
2011
2011

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 219 publications
(228 citation statements)
references
References 29 publications
0
228
0
Order By: Relevance
“…Therefore from Theorem 12, for any well-typed λ c (Σ)-term [3] of λ c (Σ), while the left hand side roughly corresponds to the mapping ρ → λk . k # (A M ρ).…”
Section: : T I → ((I ⇒ T R) ⇒ T R)mentioning
confidence: 98%
“…Therefore from Theorem 12, for any well-typed λ c (Σ)-term [3] of λ c (Σ), while the left hand side roughly corresponds to the mapping ρ → λk . k # (A M ρ).…”
Section: : T I → ((I ⇒ T R) ⇒ T R)mentioning
confidence: 98%
“…The do-notation is the notation for monadic code [40]. Not only can monadic code represent CPS [41], it also helps with composability by giving complete control over how different effects are layered (state, exception, non-determinism, etc.) on top of the basic monad [42].…”
Section: Monadic Notation Making Cps Code Clearmentioning
confidence: 99%
“…Delimited-control operators such as shift and reset have been found rather expressive: Filinski [6] proved that they can express any monadic effect, and Kiselyov, Shan and Sabry have shown a concise encoding of dynamic binding and local states in terms of them [9]. Kameyama, Kiselyov and Shan [7] have introduced control operators to type-safe multi-stage calculi, and shown that memoization in code generators is expressible as let-insertion in the calculus.…”
Section: Introductionmentioning
confidence: 99%