Value recursion in monadic computations

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii

[1]  Koen Claessen.  Embedded Languages for Describing and Verifying Hardware , 2001 .

[2]  Paul Hudak,et al.  Modular monadic semantics and compilation , 1998 .

[3]  Andrew K. Wright.  Simple imperative polymorphism , 1995, LISP Symb. Comput..

[4]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[5]  Masahito Hasegawa,et al.  Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi , 1997, TLCA.

[6]  Andrew M. Pitts,et al.  Parametric polymorphism and operational equivalence , 2000, Mathematical Structures in Computer Science.

[7]  John Hughes,et al.  Why Functional Programming Matters , 1989, Comput. J..

[8]  D. A. Turner,et al.  A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..

[9]  John Hughes,et al.  Generalising monads to arrows , 2000, Sci. Comput. Program..

[10]  Philip Wadler.  Monads for Functional Programming , 1995, Advanced Functional Programming.

[11]  Philip Wadler,et al.  Monads and composable continuations , 1994, LISP Symb. Comput..

[12]  John C. Reynolds.  Theories of programming languages , 1998 .

[13]  R. Bird.  Introduction to functional programming using Haskell, Second Edition , 1998 .

[14]  Mark P. Jones,et al.  Typing Haskell in Haskell , 1999 .

[15]  Uday S. Reddy,et al.  Imperative functional programming , 1996, CSUR.

[16]  Ross Street,et al.  Traced monoidal categories , 1996 .

[17]  Koen Claessen,et al.  Observable Sharing for Functional Circuit Description , 1999, ASIAN.

[18]  Masahito Hasegawa,et al.  Models of sharing graphs : a categorical semantics of let and letrec , 1999 .

[19]  Mark P. Jones,et al.  First-class polymorphism with type inference , 1997, POPL '97.

[20]  John Launchbury,et al.  A natural semantics for lazy evaluation , 1993, POPL '93.

[21]  Ross Paterson,et al.  A new notation for arrows , 2001, ICFP '01.

[22]  Philip Wadler,et al.  Combining Monads , 1992 .

[23]  Simon L. Peyton Jones,et al.  Lazy functional state threads , 1994, PLDI '94.

[24]  Peter Sestoft,et al.  Deriving a lazy abstract machine , 1997, Journal of Functional Programming.

[25]  John C. Reynolds,et al.  Types, Abstraction and Parametric Polymorphism , 1983, IFIP Congress.

[26]  Robert Harper,et al.  Typing first-class continuations in ML , 1991, POPL '91.

[27]  Koen Claessen,et al.  Typed Logical Variables in Haskell , 2001, ACM SIGPLAN Symposium/Workshop on Haskell.

[28]  Paul Hudak,et al.  Monad transformers and modular interpreters , 1995, POPL '95.

[29]  Andrzej Filinski,et al.  Representing monads , 1994, POPL '94.

[30]  Glynn Winskel,et al.  The formal semantics of programming languages - an introduction , 1993, Foundation of computing series.

[31]  Edmund Robinson,et al.  Premonoidal categories and notions of computation , 1997, Mathematical Structures in Computer Science.

[32]  Joe B. Wells,et al.  Cycle therapy: a prescription for fold and unfold on regular trees , 2001, PPDP '01.

[33]  Philip Wadler,et al.  Comprehending monads , 1990, LISP and Functional Programming.

[34]  Robert Hieb,et al.  The Revised Report on the Syntactic Theories of Sequential Control and State , 1992, Theor. Comput. Sci..

[35]  Magnus Carlsson,et al.  Programming with Fudgets , 1995, Advanced Functional Programming.

[36]  John Launchbury,et al.  On embedding a microarchitectural design language within Haskell , 1999, ICFP '99.

[37]  S. Maclane,et al.  Categories for the Working Mathematician , 1971 .

[38]  Graham Hutton,et al.  The generic approximation lemma , 2001, Inf. Process. Lett..

[39]  R. Kent Dybvig,et al.  Revised5 Report on the Algorithmic Language Scheme , 1986, SIGP.

[40]  Andrew Donald Gordon,et al.  Functional programming and input/output , 1995 .

[41]  Johan Nordlander,et al.  Reactive Objects and Functional Programming , 1999 .

[42]  Peter Claussen.  Theories of programming languages , 2000, SOEN.

[43]  Philip Wadler,et al.  Comprehending monads , 1990, Mathematical Structures in Computer Science.

[44]  Maarten M. Fokkinga,et al.  Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire , 1991, FPCA.

[45]  A. Pitts.  Parametric polymorphism and operational equivalence , 2000, Mathematical Structures in Computer Science.

[46]  Hayo Thielecke,et al.  Closed Freyd- and kappa-categories , 1999, ICALP.

[47]  Hayo Thielecke,et al.  Using a Continuation Twice and Its Implications for the Expressive Power of call/cc , 1999, High. Order Symb. Comput..

[48]  Mary Sheeran,et al.  Lava: hardware design in Haskell , 1998, ICFP '98.

[50]  Simon L. Peyton Jones,et al.  Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.

[51]  Simon L. Peyton Jones,et al.  Porting the Clean Object I/O Library to Haskell , 2000, IFL.

[52]  Nick Benton,et al.  Monads and Effects , 2000, APPSEM.

[53]  Alex K. Simpson.  A Characterisation of the Least-Fixed-Point Operator by Dinaturality , 1993, Theor. Comput. Sci..

[54]  Joseph E. Stoy,et al.  Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .

[55]  Magnus Carlsson,et al.  Fudgets - Purely Functional Processes with applications to Graphical User Interfaces , 1998 .

[56]  Andrew Moran,et al.  Semantics of value recursion for Monadic Input/Output , 2002, RAIRO Theor. Informatics Appl..

[57]  Simon L. Peyton Jones,et al.  Asynchronous exceptions in Haskell , 2001, PLDI '01.

[58]  Levent Erkok,et al.  A Recursive do for Haskell: Design And Implementation , 2000 .

[59]  Richard S. Bird,et al.  Introduction to functional programming using haskeu , 1998 .

[60]  John Launchbury,et al.  Parametricity and Unboxing with Unpointed Types , 1996, ESOP.

[61]  Simon L. Peyton Jones,et al.  Imperative functional programming , 1993, POPL '93.

[62]  Richard S. Bird.  Using circular programs to eliminate multiple traversals of data , 2004, Acta Informatica.

[63]  John Launchbury,et al.  Recursive monadic bindings , 2000, ICFP '00.

[64]  Robert D. Tennent,et al.  Semantics of programming languages , 1991, Prentice Hall International Series in Computer Science.

[65]  Peter D. Mosses.  Semantics, modularity, and rewriting logic , 1998, WRLA.

[66]  John Launchbury,et al.  A recursive do for Haskell , 2002, Haskell '02.

[67]  Benjamin C. Pierce,et al.  Basic category theory for computer scientists , 1991, Foundations of computing.

[68]  Gordon D. Plotkin,et al.  Complete axioms for categorical fixed-point operators , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[69]  Zoltán Ésik,et al.  Fixed-Point Operations on ccc's. Part I , 1996, Theor. Comput. Sci..