Optimizing ML using a hierarchy of monadic types-Reference-Cited by-同舟云学术

Optimizing ML using a hierarchy of monadic types

Published:1998 Issue: Volume: Page:97-115
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Tolmach Andrew

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0055514

Reference21 articles.

1. A. Appel. Compiling with Continuations. Cambridge University Press, 1992.

2. A. Appel. Loop headers in λ-calculus or CPS. Lisp and Symbolic Computation, 7(4): 337–343, 1994.

3. N. Benton, July 1997. Personal communication.

4. L. Birkedal, M. Tofte, and M. Vejlstrup. From region inference to von Neumann machines via region representation inference. In 23rd ACM Symposium on Principles of Programming Languages (POPL’96), pages 171–183. ACM Press, 1996.

5. C. Flanagan, A. Sabry, B. F. Duba, and M. Felleisen. The essence of compiling with continuations. Proc. SIGPLAN Conference on Programming Language Design and Implementation, 28(6): 237–247, June 1993.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order;Programming Languages and Systems;2019

2. Factorisation Systems for Logical Relations and Monadic Lifting in Type-and-effect System Semantics;Electronic Notes in Theoretical Computer Science;2018-12

3. No value restriction is needed for algebraic effects and handlers;Journal of Functional Programming;2017

4. Counting Successes: Effects and Transformations for Non-deterministic Programs;A List of Successes That Can Change the World;2016

5. Inferring Algebraic Effects;Logical Methods in Computer Science;2014-09-12