The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Philip Wadler: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Philip Wadler
    Comprehending Monads. [Citation Graph (8, 0)][DBLP]
    LISP and Functional Programming, 1990, pp:61-78 [Conf]
  2. Philip Wadler
    Comprehending Monads. [Citation Graph (4, 0)][DBLP]
    Mathematical Structures in Computer Science, 1992, v:2, n:4, pp:461-493 [Journal]
  3. Gilad Bracha, Martin Odersky, David Stoutamire, Philip Wadler
    Making the Future Safe for the Past: Adding Genericity to the Java Programming Language. [Citation Graph (2, 0)][DBLP]
    OOPSLA, 1998, pp:183-200 [Conf]
  4. Philip Wadler
    Monads for Functional Programming. [Citation Graph (1, 0)][DBLP]
    Advanced Functional Programming, 1995, pp:24-52 [Conf]
  5. Philip Wadler
    Deforestation: Transforming Programs to Eliminate Trees. [Citation Graph (1, 0)][DBLP]
    ESOP, 1988, pp:344-358 [Conf]
  6. Mary F. Fernández, Jérôme Siméon, Philip Wadler
    An Algebra for XML Query. [Citation Graph (1, 0)][DBLP]
    FSTTCS, 2000, pp:11-45 [Conf]
  7. Simon L. Peyton Jones, Philip Wadler
    Imperative Functional Programming. [Citation Graph (1, 0)][DBLP]
    POPL, 1993, pp:71-84 [Conf]
  8. Martin Odersky, Philip Wadler
    Pizza into Java: Translating Theory into Practice. [Citation Graph (1, 0)][DBLP]
    POPL, 1997, pp:146-159 [Conf]
  9. Philip Wadler
    Views: A Way for Pattern Matching to Cohabit with Data Abstraction. [Citation Graph (1, 0)][DBLP]
    POPL, 1987, pp:307-313 [Conf]
  10. Philip Wadler
    The Essence of Functional Programming. [Citation Graph (1, 0)][DBLP]
    POPL, 1992, pp:1-14 [Conf]
  11. Philip Wadler, Stephen Blott
    How to Make ad-hoc Polymorphism Less ad-hoc. [Citation Graph (1, 0)][DBLP]
    POPL, 1989, pp:60-76 [Conf]
  12. Philip Wadler
    How to Declare an Imperative. [Citation Graph (1, 0)][DBLP]
    ACM Comput. Surv., 1997, v:29, n:3, pp:240-263 [Journal]
  13. Paul Hudak, Simon L. Peyton Jones, Philip Wadler, Brian Boutel, Jon Fairbairn, Joseph H. Fasel, María M. Guzmán, Kevin Hammond, John Hughes, Thomas Johnsson, Richard B. Kieburtz, Rishiyur S. Nikhil, Will Partain, John Peterson
    Report on the Programming Language Haskell, A Non-strict, Purely Functional Language. [Citation Graph (1, 0)][DBLP]
    SIGPLAN Notices, 1992, v:27, n:5, pp:0-0 [Journal]
  14. Philip Wadler
    XQuery: A Typed Functional Language for Querying XML. [Citation Graph (0, 0)][DBLP]
    Advanced Functional Programming, 2002, pp:188-212 [Conf]
  15. Martin Odersky, Enno Runne, Philip Wadler
    Two Ways to Bake Your Pizza - Translating Parameterised Types into Java. [Citation Graph (0, 0)][DBLP]
    Generic Programming, 1998, pp:114-132 [Conf]
  16. Philip Wadler
    Functional Programming: An Angry Half-Dozen. [Citation Graph (0, 10)][DBLP]
    DBPL, 1997, pp:25-34 [Conf]
  17. Kim B. Bruce, Martin Odersky, Philip Wadler
    A Statically Safe Alternative to Virtual Types. [Citation Graph (0, 0)][DBLP]
    ECOOP, 1998, pp:523-549 [Conf]
  18. Cordelia V. Hall, Kevin Hammond, Simon L. Peyton Jones, Philip Wadler
    Type Classes in Haskell. [Citation Graph (0, 0)][DBLP]
    ESOP, 1994, pp:241-256 [Conf]
  19. Jérôme Siméon, Philip Wadler
    The Essence of XML (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    FLOPS, 2002, pp:21-46 [Conf]
  20. John Launchbury, Andy Gill, John Hughes, Simon Marlow, Simon L. Peyton Jones, Philip Wadler
    Avoiding Unnecessary Updates. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1992, pp:144-153 [Conf]
  21. Simon Marlow, Philip Wadler
    Deforestation for Higher-Order Functions. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1992, pp:154-165 [Conf]
  22. Kei Davis, Philip Wadler
    Backwards Strictness Analysis: Proved and Improved. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1989, pp:12-30 [Conf]
  23. Cordelia V. Hall, Kevin Hammond, Will Partain, Simon L. Peyton Jones, Philip Wadler
    The Glasgow Haskell Compiler: A Retrospective. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1992, pp:62-71 [Conf]
  24. David J. King, Philip Wadler
    Combining Monads. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1992, pp:134-143 [Conf]
  25. Martin Odersky, Philip Wadler, Martin Wehr
    A Second Look at Overloading. [Citation Graph (0, 0)][DBLP]
    FPCA, 1995, pp:135-146 [Conf]
  26. David N. Turner, Philip Wadler, Christian Mossin
    Once Upon a Type. [Citation Graph (0, 0)][DBLP]
    FPCA, 1995, pp:1-11 [Conf]
  27. Philip Wadler
    How to Replace Failure by a List of Successes: A method for exception handling, backtracking, and pattern matching in lazy functional languages. [Citation Graph (0, 0)][DBLP]
    FPCA, 1985, pp:113-128 [Conf]
  28. Philip Wadler
    Theorems for Free! [Citation Graph (0, 0)][DBLP]
    FPCA, 1989, pp:347-359 [Conf]
  29. Philip Wadler, R. J. M. Hughes
    Projections for strictness analysis. [Citation Graph (0, 0)][DBLP]
    FPCA, 1987, pp:385-407 [Conf]
  30. Philip Wadler
    A new array operation. [Citation Graph (0, 0)][DBLP]
    Graph Reduction, 1986, pp:328-335 [Conf]
  31. Mary F. Fernández, Jérôme Siméon, Philip Wadler
    A Semi-monad for Semi-structured Data. [Citation Graph (0, 24)][DBLP]
    ICDT, 2001, pp:263-300 [Conf]
  32. Simon Marlow, Philip Wadler
    A Practical Subtyping System For Erlang. [Citation Graph (0, 0)][DBLP]
    ICFP, 1997, pp:136-149 [Conf]
  33. Amr Sabry, Philip Wadler
    A Reflection on Call-by-Value. [Citation Graph (0, 0)][DBLP]
    ICFP, 1996, pp:13-24 [Conf]
  34. Philip Wadler
    Call-by-value is dual to call-by-name. [Citation Graph (0, 0)][DBLP]
    ICFP, 2003, pp:189-201 [Conf]
  35. Philip Wadler
    The Marriage of Effects and Monads. [Citation Graph (0, 0)][DBLP]
    ICFP, 1998, pp:63-74 [Conf]
  36. Philip Wadler
    Static Analysis Refuses to Stay Still: Prospects of Static Analysis for Dynamic Allocation (Abstract) [Citation Graph (0, 0)][DBLP]
    IWMM, 1995, pp:117- [Conf]
  37. Philip Wadler
    Listlessness is Better than Laziness: Lazy Evaluation and Garbage Collection at Compile Time. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1984, pp:45-52 [Conf]
  38. P. N. Benton, Philip Wadler
    Linear Logic, Monads and the Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:420-431 [Conf]
  39. Philip Wadler
    A Taste of Linear Logic. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:185-210 [Conf]
  40. Philip Wadler
    A Syntax for Linear Logic. [Citation Graph (0, 0)][DBLP]
    MFPS, 1993, pp:513-529 [Conf]
  41. Atsushi Igarashi, Benjamin C. Pierce, Philip Wadler
    Featherwieght Java: A Minimal Core Calculus for Java and GJ. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 1999, pp:132-146 [Conf]
  42. Philip Wadler
    Faith, evolution, and programming languages: from Haskell to Java to links. [Citation Graph (0, 0)][DBLP]
    OOPSLA Companion, 2006, pp:508- [Conf]
  43. Philip Wadler
    Listlessness is better than laziness II: composing listless functions. [Citation Graph (0, 0)][DBLP]
    Programs as Data Objects, 1985, pp:282-305 [Conf]
  44. Philip Wadler
    Is There a Use for Linear Logic? [Citation Graph (0, 0)][DBLP]
    PEPM, 1991, pp:255-273 [Conf]
  45. Zena M. Ariola, Matthias Felleisen, John Maraist, Martin Odersky, Philip Wadler
    The Call-by-Need Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    POPL, 1995, pp:233-246 [Conf]
  46. James H. Morris Jr., Eric Schmidt, Philip Wadler
    Experience with an Applicative String Processing Language. [Citation Graph (0, 0)][DBLP]
    POPL, 1980, pp:32-46 [Conf]
  47. Jérôme Siméon, Philip Wadler
    The essence of XML. [Citation Graph (0, 0)][DBLP]
    POPL, 2003, pp:1-13 [Conf]
  48. Philip Wadler
    Strictness Analysis Aids Time Analysis. [Citation Graph (0, 0)][DBLP]
    POPL, 1988, pp:119-132 [Conf]
  49. Philip Wadler
    Call-by-Value Is Dual to Call-by-Name - Reloaded. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:185-203 [Conf]
  50. Philip Wadler
    How to Declare an Imperative. [Citation Graph (0, 0)][DBLP]
    ILPS, 1995, pp:18-32 [Conf]
  51. Philip Wadler
    The Girard-Reynolds Isomorphism. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:468-491 [Conf]
  52. Philip Wadler
    Et tu, XML? The downfall of the relational empire (abstract). [Citation Graph (0, 0)][DBLP]
    VLDB, 2001, pp:15- [Conf]
  53. Allen Brown, Matthew Fuchs, Jonathan Robie, Philip Wadler
    MSL - a model for W3C XML schema. [Citation Graph (0, 0)][DBLP]
    WWW, 2001, pp:191-200 [Conf]
  54. Philip Wadler
    Analysis of an Algorithm for Real Time Garbage Collection. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1976, v:19, n:9, pp:491-500 [Journal]
  55. Allen Brown, Matthew Fuchs, Jonathan Robie, Philip Wadler
    MSL: a model for W3C XML Schema. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2002, v:39, n:5, pp:507-521 [Journal]
  56. Philip Wadler
    Lazy Versus Strict. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:2, pp:318-320 [Journal]
  57. John Maraist, Martin Odersky, David N. Turner, Philip Wadler
    Call-by-name, call-by-value, call-by-need and the linear lambda calculus. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:1, n:, pp:- [Journal]
  58. Philip Wadler
    The Girard-Reynolds isomorphism. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:186, n:2, pp:260-284 [Journal]
  59. Simon L. Peyton Jones, Philip Wadler
    The Educational Pearls column. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:5, pp:833-834 [Journal]
  60. John Maraist, Martin Odersky, Philip Wadler
    The Call-by-Need Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1998, v:8, n:3, pp:275-317 [Journal]
  61. Simon J. Thompson, Philip Wadler
    Functional Programming in Education - Introduction. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1993, v:3, n:1, pp:3-4 [Journal]
  62. Philip Wadler
    Monads and Composable Continuations. [Citation Graph (0, 0)][DBLP]
    Lisp and Symbolic Computation, 1994, v:7, n:1, pp:39-56 [Journal]
  63. Joseph H. Fasel, Paul Hudak, Simon L. Peyton Jones, Philip Wadler
    SIGPLAN Notices Special Issue on the Functional Programming Language Haskell. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1992, v:27, n:5, pp:1- [Journal]
  64. Philip Wadler
    An Angry Half-Dozen. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1998, v:33, n:2, pp:25-30 [Journal]
  65. Philip Wadler
    Why No One Uses Functional Languages. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1998, v:33, n:8, pp:23-27 [Journal]
  66. Philip Wadler
    A Simple Language is also a Functional Language. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1985, v:15, n:2, pp:219- [Journal]
  67. Philip Wadler
    Fixing some Space Leaks with a Garbage Collector. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1987, v:17, n:9, pp:595-608 [Journal]
  68. John Maraist, Martin Odersky, David N. Turner, Philip Wadler
    Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:228, n:1-2, pp:175-210 [Journal]
  69. David N. Turner, Philip Wadler
    Operational Interpretations of Linear Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:227, n:1-2, pp:231-248 [Journal]
  70. Philip Wadler
    Deforestation: Transforming Programs to Eliminate Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:73, n:2, pp:231-248 [Journal]
  71. Philip Wadler
    The Girard-Reynolds isomorphism (second edition). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:375, n:1-3, pp:201-226 [Journal]
  72. Olivier Danvy, Peter W. O'Hearn, Philip Wadler
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:375, n:1-3, pp:1-2 [Journal]
  73. Philip Wadler, Peter Thiemann
    The marriage of effects and monads. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2003, v:4, n:1, pp:1-32 [Journal]
  74. Cordelia V. Hall, Kevin Hammond, Simon L. Peyton Jones, Philip Wadler
    Type Classes in Haskell. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1996, v:18, n:2, pp:109-138 [Journal]
  75. Atsushi Igarashi, Benjamin C. Pierce, Philip Wadler
    Featherweight Java: a minimal core calculus for Java and GJ. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2001, v:23, n:3, pp:396-450 [Journal]
  76. Amr Sabry, Philip Wadler
    A Reflection on Call-by-Value. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1997, v:19, n:6, pp:916-941 [Journal]
  77. Paul Hudak, John Hughes, Simon L. Peyton Jones, Philip Wadler
    A history of Haskell: being lazy with class. [Citation Graph (0, 0)][DBLP]
    HOPL, 2007, pp:1-55 [Conf]
  78. Simon L. Peyton Jones, Philip Wadler
    Comprehensive comprehensions. [Citation Graph (0, 0)][DBLP]
    Haskell, 2007, pp:61-72 [Conf]

  79. The Essence of Form Abstraction. [Citation Graph (, )][DBLP]


  80. 07051 Abstracts Collection -- Programming Paradigms for the Web: Web Programming and Web Services. [Citation Graph (, )][DBLP]


  81. 07051 Working Group Outcomes -- Programming Paradigms for the Web: Web Programming and Web Services. [Citation Graph (, )][DBLP]


  82. 07051 Executive Summary -- Programming Paradigms for the Web: Web Programming and Web Services. [Citation Graph (, )][DBLP]


  83. Well-Typed Programs Can't Be Blamed. [Citation Graph (, )][DBLP]


  84. The Audacity of Hope: Thoughts on Reclaiming the Database Dream. [Citation Graph (, )][DBLP]


  85. Links: Web Programming Without Tiers. [Citation Graph (, )][DBLP]


  86. Threesomes, with and without blame. [Citation Graph (, )][DBLP]


  87. The RPC calculus. [Citation Graph (, )][DBLP]


Search in 0.140secs, Finished in 0.144secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002