论文信息 - Numerical Representations as Purely Functional Data Structures - 字舞流文

Numerical Representations as Purely Functional Data Structures

Note: Also in: Novi Sad J. Math. 31 (2001), no. 1, 141--149 Reference LARA-CONF-2000-003 Record created on 2007-08-21, modified on 2017-05-12

Viktor Kuncak | M. Ivanović | Viktor Kunčak

[1] Richard S. Bird,et al. Introduction to functional programming , 1988, Prentice Hall International series in computer science.

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

[3] Philip W. Trinder,et al. Referentially Transparent Database Languages , 1989, Functional Programming.

[4] Alastair David Reid. Designing Data Structures , 1989, Functional Programming.

[5] David Sands,et al. Complexity Analysis for a Lazy Higher-Order Language , 1989, Functional Programming.

[6] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .

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

[8] Shail Aditya Gupta. Functional encapsulation and type reconstruction in a strongly-typed, polymorphic language , 1995 .

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

[10] Simon Peyton Jones,et al. Type classes: an exploration of the design space , 1997 .

[11] Nicholas Pippenger,et al. Pure versus impure Lisp , 1997, TOPL.

[12] Philip Wadler,et al. How to declare an imperative , 1997, CSUR.

[13] Chris Okasaki,et al. Purely functional data structures , 1998 .

[14] Ralf Hinze,et al. Haskell 98 — A Non−strict‚ Purely Functional Language , 1999 .