Rolling Your Own Mutable ADT --- A Connection between Linear Types and Monads --- (1997)

Cached

Download Links

by Chih-ping Chen , Paul Hudak
Venue:In Proc. Symp. POPL '97, ACM
Citations:13 - 0 self

Active Bibliography

94 How to Declare an Imperative – Philip Wadler - 1995
16 Mutable abstract datatypes -- or -- how to have your state and munge it too – Paul Hudak - 1992
1225 Introduction to functional programming – Philip Wadler - 1995
27 A Functional Theory of Local Names – Martin Odersky - 1994
20 Correctness of Monadic State: An Imperative Call-by-Need Calculus – Zena M. Ariola, Amr Sabry - 1998
77 Once Upon a Type – David Turner, Philip Wadler, Christian Mossin - 1995
26 Call-by-Name, Call-by-Value, Call-by-Need, and the Linear Lambda Calculus – John Maraist, Martin Odersky, David N. Turner, Philip Wadler - 1994
418 Comprehending Monads – Philip Wadler - 1992
95 Modular Domain Specific Languages and Tools – Paul Hudak - 1998
39 Monads and Effects – Nick Benton, John Hughes, Eugenio Moggi - 2000
17 Linearity and Laziness – David Wakeling, Colin Runciman - 1990
March 1991 – Ar Ch, Philip Wadler - 1991
85 Is there a use for linear logic? – Philip Wadler - 1991
128 Alias Types for Recursive Data Structures – David Walker, Greg Morrisett - 2000
24 There's No Substitute for Linear Logic – Philip Wadler - 1991
21 Operational Interpretations of Linear Logic – David N. Turner, Philip Wadler - 1998
3 A Second Year Course on Data Structures Based on Functional Programming – Manuel Nunez, Pedro Palao, Ricardo Pena - 1995
22 Observers for Linear Types – Martin Odersky - 1992
1 Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles – Seyed H. Haeri - 2009