| 2009 |
|---|
| 91 | EE | Philip Wadler,
Robert Bruce Findler:
Well-Typed Programs Can't Be Blamed.
ESOP 2009: 1-16 |
| 2008 |
|---|
| 90 | | George C. Necula,
Philip Wadler:
Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008
ACM 2008 |
| 89 | EE | Ezra Cooper,
Sam Lindley,
Philip Wadler,
Jeremy Yallop:
The Essence of Form Abstraction.
APLAS 2008: 205-220 |
| 2007 |
|---|
| 88 | | Richard Hull,
Peter Thiemann,
Philip Wadler:
Programming Paradigms for the Web: Web Programming and Web Services, 28.01. - 02.02.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
| 87 | EE | Paul Hudak,
John Hughes,
Simon L. Peyton Jones,
Philip Wadler:
A history of Haskell: being lazy with class.
HOPL 2007: 1-55 |
| 86 | EE | Simon L. Peyton Jones,
Philip Wadler:
Comprehensive comprehensions.
Haskell 2007: 61-72 |
| 85 | EE | Richard Hull,
Peter Thiemann,
Philip Wadler:
07051 Abstracts Collection -- Programming Paradigms for the Web: Web Programming and Web Services.
Programming Paradigms for the Web: Web Programming and Web Services 2007 |
| 84 | EE | Richard Hull,
Peter Thiemann,
Philip Wadler:
07051 Executive Summary -- Programming Paradigms for the Web: Web Programming and Web Services.
Programming Paradigms for the Web: Web Programming and Web Services 2007 |
| 83 | EE | Richard Hull,
Peter Thiemann,
Philip Wadler:
07051 Working Group Outcomes -- Programming Paradigms for the Web: Web Programming and Web Services.
Programming Paradigms for the Web: Web Programming and Web Services 2007 |
| 82 | EE | Olivier Danvy,
Peter W. O'Hearn,
Philip Wadler:
Preface.
Theor. Comput. Sci. 375(1-3): 1-2 (2007) |
| 81 | EE | Philip Wadler:
The Girard-Reynolds isomorphism (second edition).
Theor. Comput. Sci. 375(1-3): 201-226 (2007) |
| 2006 |
|---|
| 80 | | Masami Hagiya,
Philip Wadler:
Functional and Logic Programming, 8th International Symposium, FLOPS 2006, Fuji-Susono, Japan, April 24-26, 2006, Proceedings
Springer 2006 |
| 79 | EE | Ezra Cooper,
Sam Lindley,
Philip Wadler,
Jeremy Yallop:
Links: Web Programming Without Tiers.
FMCO 2006: 266-296 |
| 78 | EE | Philip Wadler:
Faith, evolution, and programming languages: from Haskell to Java to links.
OOPSLA Companion 2006: 508 |
| 2005 |
|---|
| 77 | EE | Philip Wadler:
Call-by-Value Is Dual to Call-by-Name - Reloaded.
RTA 2005: 185-203 |
| 2004 |
|---|
| 76 | | Francesco Cesarini,
Philip Wadler:
Proceedings of the 2004 ACM SIGPLAN Workshop on Erlang, Snowbird, Utah, USA, September 22, 2004
ACM 2004 |
| 2003 |
|---|
| 75 | | Verónica Dahl,
Philip Wadler:
Practical Aspects of Declarative Languages, 5th International Symposium, PADL 2003, New Orleans, LA, USA, January 13-14, 2003, Proceedings
Springer 2003 |
| 74 | EE | Philip Wadler:
Call-by-value is dual to call-by-name.
ICFP 2003: 189-201 |
| 73 | EE | Jérôme Siméon,
Philip Wadler:
The essence of XML.
POPL 2003: 1-13 |
| 72 | EE | Philip Wadler,
Peter Thiemann:
The marriage of effects and monads.
ACM Trans. Comput. Log. 4(1): 1-32 (2003) |
| 71 | EE | Philip Wadler:
The Girard-Reynolds isomorphism.
Inf. Comput. 186(2): 260-284 (2003) |
| 70 | EE | Simon L. Peyton Jones,
Philip Wadler:
The Educational Pearls column.
J. Funct. Program. 13(5): 833-834 (2003) |
| 2002 |
|---|
| 69 | EE | Philip Wadler:
XQuery: A Typed Functional Language for Querying XML.
Advanced Functional Programming 2002: 188-212 |
| 68 | EE | Jérôme Siméon,
Philip Wadler:
The Essence of XML (Preliminary Version).
FLOPS 2002: 21-46 |
| 67 | EE | Allen Brown,
Matthew Fuchs,
Jonathan Robie,
Philip Wadler:
MSL: a model for W3C XML Schema.
Computer Networks 39(5): 507-521 (2002) |
| 2001 |
|---|
| 66 | EE | Mary F. Fernández,
Jérôme Siméon,
Philip Wadler:
A Semi-monad for Semi-structured Data.
ICDT 2001: 263-300 |
| 65 | EE | Philip Wadler:
The Girard-Reynolds Isomorphism.
TACS 2001: 468-491 |
| 64 | EE | Philip Wadler:
Et tu, XML? The downfall of the relational empire (abstract).
VLDB 2001: 15 |
| 63 | EE | Allen Brown,
Matthew Fuchs,
Jonathan Robie,
Philip Wadler:
MSL - a model for W3C XML schema.
WWW 2001: 191-200 |
| 62 | EE | Atsushi Igarashi,
Benjamin C. Pierce,
Philip Wadler:
Featherweight Java: a minimal core calculus for Java and GJ.
ACM Trans. Program. Lang. Syst. 23(3): 396-450 (2001) |
| 61 | | Peter Fankhauser,
Mary F. Fernández,
Ashok Malhotra,
Michael Rys,
Jérôme Siméon,
Philip Wadler:
The XML Query Algebra
http://www.w3.org/TR/2000/WD-query-algebra-20001204/ 2001 |
| 2000 |
|---|
| 60 | EE | Mary F. Fernández,
Jérôme Siméon,
Philip Wadler:
An Algebra for XML Query.
FSTTCS 2000: 11-45 |
| 1999 |
|---|
| 59 | EE | Atsushi Igarashi,
Benjamin C. Pierce,
Philip Wadler:
Featherwieght Java: A Minimal Core Calculus for Java and GJ.
OOPSLA 1999: 132-146 |
| 58 | EE | David N. Turner,
Philip Wadler:
Operational Interpretations of Linear Logic.
Theor. Comput. Sci. 227(1-2): 231-248 (1999) |
| 57 | EE | John Maraist,
Martin Odersky,
David N. Turner,
Philip Wadler:
Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus.
Theor. Comput. Sci. 228(1-2): 175-210 (1999) |
| 1998 |
|---|
| 56 | EE | Kim B. Bruce,
Martin Odersky,
Philip Wadler:
A Statically Safe Alternative to Virtual Types.
ECOOP 1998: 523-549 |
| 55 | EE | Martin Odersky,
Enno Runne,
Philip Wadler:
Two Ways to Bake Your Pizza - Translating Parameterised Types into Java.
Generic Programming 1998: 114-132 |
| 54 | EE | Philip Wadler:
The Marriage of Effects and Monads.
ICFP 1998: 63-74 |
| 53 | EE | Gilad Bracha,
Martin Odersky,
David Stoutamire,
Philip Wadler:
Making the Future Safe for the Past: Adding Genericity to the Java Programming Language.
OOPSLA 1998: 183-200 |
| 52 | | John Maraist,
Martin Odersky,
Philip Wadler:
The Call-by-Need Lambda Calculus.
J. Funct. Program. 8(3): 275-317 (1998) |
| 51 | | Philip Wadler:
An Angry Half-Dozen.
SIGPLAN Notices 33(2): 25-30 (1998) |
| 50 | | Philip Wadler:
Why No One Uses Functional Languages.
SIGPLAN Notices 33(8): 23-27 (1998) |
| 1997 |
|---|
| 49 | EE | Philip Wadler:
Functional Programming: An Angry Half-Dozen.
DBPL 1997: 25-34 |
| 48 | | Simon Marlow,
Philip Wadler:
A Practical Subtyping System For Erlang.
ICFP 1997: 136-149 |
| 47 | EE | Martin Odersky,
Philip Wadler:
Pizza into Java: Translating Theory into Practice.
POPL 1997: 146-159 |
| 46 | EE | Philip Wadler:
How to Declare an Imperative.
ACM Comput. Surv. 29(3): 240-263 (1997) |
| 45 | EE | Amr Sabry,
Philip Wadler:
A Reflection on Call-by-Value.
ACM Trans. Program. Lang. Syst. 19(6): 916-941 (1997) |
| 1996 |
|---|
| 44 | | Amr Sabry,
Philip Wadler:
A Reflection on Call-by-Value.
ICFP 1996: 13-24 |
| 43 | | P. N. Benton,
Philip Wadler:
Linear Logic, Monads and the Lambda Calculus.
LICS 1996: 420-431 |
| 42 | | Philip Wadler:
Lazy Versus Strict.
ACM Comput. Surv. 28(2): 318-320 (1996) |
| 41 | EE | Cordelia V. Hall,
Kevin Hammond,
Simon L. Peyton Jones,
Philip Wadler:
Type Classes in Haskell.
ACM Trans. Program. Lang. Syst. 18(2): 109-138 (1996) |
| 1995 |
|---|
| 40 | | Philip Wadler:
Monads for Functional Programming.
Advanced Functional Programming 1995: 24-52 |
| 39 | | David N. Turner,
Philip Wadler,
Christian Mossin:
Once Upon a Type.
FPCA 1995: 1-11 |
| 38 | | Martin Odersky,
Philip Wadler,
Martin Wehr:
A Second Look at Overloading.
FPCA 1995: 135-146 |
| 37 | | Philip Wadler:
How to Declare an Imperative.
ILPS 1995: 18-32 |
| 36 | | Philip Wadler:
Static Analysis Refuses to Stay Still: Prospects of Static Analysis for Dynamic Allocation (Abstract)
IWMM 1995: 117 |
| 35 | | Zena M. Ariola,
Matthias Felleisen,
John Maraist,
Martin Odersky,
Philip Wadler:
The Call-by-Need Lambda Calculus.
POPL 1995: 233-246 |
| 34 | EE | John Maraist,
Martin Odersky,
David N. Turner,
Philip Wadler:
Call-by-name, call-by-value, call-by-need and the linear lambda calculus.
Electr. Notes Theor. Comput. Sci. 1: (1995) |
| 1994 |
|---|
| 33 | | Cordelia V. Hall,
Kevin Hammond,
Simon L. Peyton Jones,
Philip Wadler:
Type Classes in Haskell.
ESOP 1994: 241-256 |
| 32 | | Philip Wadler:
Monads and Composable Continuations.
Lisp and Symbolic Computation 7(1): 39-56 (1994) |
| 1993 |
|---|
| 31 | | Philip Wadler:
A Taste of Linear Logic.
MFCS 1993: 185-210 |
| 30 | | Philip Wadler:
A Syntax for Linear Logic.
MFPS 1993: 513-529 |
| 29 | | Simon L. Peyton Jones,
Philip Wadler:
Imperative Functional Programming.
POPL 1993: 71-84 |
| 28 | | Simon J. Thompson,
Philip Wadler:
Functional Programming in Education - Introduction.
J. Funct. Program. 3(1): 3-4 (1993) |
| 1992 |
|---|
| 27 | | Rogardt Heldal,
Carsten Kehler Holst,
Philip Wadler:
Functional Programming, Glasgow 1991, Proceedings of the 1991 Glasgow Workshop on Functional Programming, Portree, Isle of Skye, 12-14 August 1991
Springer 1992 |
| 26 | | David J. King,
Philip Wadler:
Combining Monads.
Functional Programming 1992: 134-143 |
| 25 | | John Launchbury,
Andy Gill,
John Hughes,
Simon Marlow,
Simon L. Peyton Jones,
Philip Wadler:
Avoiding Unnecessary Updates.
Functional Programming 1992: 144-153 |
| 24 | | Simon Marlow,
Philip Wadler:
Deforestation for Higher-Order Functions.
Functional Programming 1992: 154-165 |
| 23 | | Cordelia V. Hall,
Kevin Hammond,
Will Partain,
Simon L. Peyton Jones,
Philip Wadler:
The Glasgow Haskell Compiler: A Retrospective.
Functional Programming 1992: 62-71 |
| 22 | | Philip Wadler:
The Essence of Functional Programming.
POPL 1992: 1-14 |
| 21 | | Philip Wadler:
Comprehending Monads.
Mathematical Structures in Computer Science 2(4): 461-493 (1992) |
| 20 | | Joseph H. Fasel,
Paul Hudak,
Simon L. Peyton Jones,
Philip Wadler:
SIGPLAN Notices Special Issue on the Functional Programming Language Haskell.
SIGPLAN Notices 27(5): 1 (1992) |
| 19 | | 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.
SIGPLAN Notices 27(5): R1-R164 (1992) |
| 1991 |
|---|
| 18 | | Philip Wadler:
Is There a Use for Linear Logic?
PEPM 1991: 255-273 |
| 1990 |
|---|
| 17 | EE | Philip Wadler:
Comprehending Monads.
LISP and Functional Programming 1990: 61-78 |
| 16 | | Philip Wadler:
Deforestation: Transforming Programs to Eliminate Trees.
Theor. Comput. Sci. 73(2): 231-248 (1990) |
| 1989 |
|---|
| 15 | EE | Philip Wadler:
Theorems for Free!
FPCA 1989: 347-359 |
| 14 | | Kei Davis,
Philip Wadler:
Backwards Strictness Analysis: Proved and Improved.
Functional Programming 1989: 12-30 |
| 13 | | Philip Wadler,
Stephen Blott:
How to Make ad-hoc Polymorphism Less ad-hoc.
POPL 1989: 60-76 |
| 1988 |
|---|
| 12 | | Philip Wadler:
Deforestation: Transforming Programs to Eliminate Trees.
ESOP 1988: 344-358 |
| 11 | | Philip Wadler:
Strictness Analysis Aids Time Analysis.
POPL 1988: 119-132 |
| 1987 |
|---|
| 10 | | Philip Wadler,
R. J. M. Hughes:
Projections for strictness analysis.
FPCA 1987: 385-407 |
| 9 | | Philip Wadler:
Views: A Way for Pattern Matching to Cohabit with Data Abstraction.
POPL 1987: 307-313 |
| 8 | | Philip Wadler:
Fixing some Space Leaks with a Garbage Collector.
Softw., Pract. Exper. 17(9): 595-608 (1987) |
| 1986 |
|---|
| 7 | | Philip Wadler:
A new array operation.
Graph Reduction 1986: 328-335 |
| 1985 |
|---|
| 6 | | Philip Wadler:
How to Replace Failure by a List of Successes: A method for exception handling, backtracking, and pattern matching in lazy functional languages.
FPCA 1985: 113-128 |
| 5 | | Philip Wadler:
Listlessness is better than laziness II: composing listless functions.
Programs as Data Objects 1985: 282-305 |
| 4 | | Philip Wadler:
A Simple Language is also a Functional Language.
Softw., Pract. Exper. 15(2): 219 (1985) |
| 1984 |
|---|
| 3 | | Philip Wadler:
Listlessness is Better than Laziness: Lazy Evaluation and Garbage Collection at Compile Time.
LISP and Functional Programming 1984: 45-52 |
| 1980 |
|---|
| 2 | | James H. Morris Jr.,
Eric Schmidt,
Philip Wadler:
Experience with an Applicative String Processing Language.
POPL 1980: 32-46 |
| 1976 |
|---|
| 1 | | Philip Wadler:
Analysis of an Algorithm for Real Time Garbage Collection.
Commun. ACM 19(9): 491-500 (1976) |
