Active Bibliography

418 Comprehending Monads – Philip Wadler - 1992
94 How to Declare an Imperative – Philip Wadler - 1995
30 Monads and Composable Continuations – Philip Wadler - 1993
18 Compiling Standard ML For Efficient Execution On Modern Machines – Zhong Shao - 1994
47 Design and Implementation of Code Optimizations for a Type-Directed Compiler for Standard ML – David Tarditi - 1996
A Data Structure for More Efficient . . . – Melissa Elizabeth O’Neill - 1994
69 Representing control: a study of the CPS transformation – Olivier Danvy, Andrzej Filinski - 1992
31 A Semantic analysis of control – James David Laird - 1998
10 Recursion from Iteration – Andrzej Filinski - 1994
9 Axioms for Recursion in Call-by-Value – Masahito Hasegawa, Yoshihiko Kakutani
76 The Marriage of Effects and Monads – Philip Wadler, Peter Thiemann - 1998
11 A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations – Dariusz Biernacki, Olivier Danvy, Kevin Millikin - 2006
3 A Categorical Interpretation of Landin's Correspondence Principle – Anindya Banerjee, David A. Schmidt - 1993
17 Handling Control – Dorai Sitaram - 1993
29 Polymorphism by name for references and continuations – Xavier Leroy - 1993
27 Declarative Continuations and Categorical Duality – Andrzej Filinski - 1989
13 The Formal Relationship Between Direct and Continuation-Passing Style Optimizing Compilers: A Synthesis of Two Paradigms – Amr A. Sabry - 1994
1 Operational Interpretations of an Extension of F-omega with Control Operators – Robert Harper, Mark Lillibridge - 1995
65 Explicit Polymorphism and CPS Conversion – Robert Harper , Mark Lillibridge - 1992