Philip Wadler

According to our database1, Philip Wadler authored at least 134 papers between 1976 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Awards

ACM Fellow

ACM Fellow 2007, "For contributions to the theory of programming languages.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
The root cause of blame: contracts for intersection and union types.
PACMPL, 2018

Refinement reflection: complete verification with SMT.
PACMPL, 2018

Gradual Session Types.
CoRR, 2018

2017
Gradual session types.
PACMPL, 2017

Theorems for free for free: parametricity, with and without types.
PACMPL, 2017

Abstract Data Types without the Types.Dedicated to David Turner on the occasion of his 70'th birthday.
J. UCS, 2017

Mixed Messages: Measuring Conformance and Non-Interference in TypeScript (Artifact).
DARTS, 2017

Theory and Applications of Behavioural Types (Dagstuhl Seminar 17051).
Dagstuhl Reports, 2017

Refinement Reflection: Complete Verification with SMT.
CoRR, 2017

Quantified class constraints.
Proceedings of the 10th ACM SIGPLAN International Symposium on Haskell, 2017

Mixed Messages: Measuring Conformance and Non-Interference in TypeScript.
Proceedings of the 31st European Conference on Object-Oriented Programming, 2017

Mixing Metaphors: Actors as Channels and Channels as Actors.
Proceedings of the 31st European Conference on Object-Oriented Programming, 2017

2016
Embedding by Normalisation.
CoRR, 2016

Mixing Metaphors: Actors as Channels and Channels as Actors.
CoRR, 2016

Technical Perspective: Why didn't I think of that?
Commun. ACM, 2016

Everything old is new again: quoted domain-specific languages.
Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2016

Coherence Generalises Duality: A Logical Explanation of Multiparty Session Types.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

Usability of Programming Languages: Special Interest Group (SIG) Meeting at CHI 2016.
Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems, 2016

2015
Everything old is new again: Quoted Domain Specific Languages.
CoRR, 2015

Propositions as types.
Commun. ACM, 2015

A Complement to Blame.
Proceedings of the 1st Summit on Advances in Programming Languages, 2015

Blame and coercion: together again for the first time.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

2014
Software Contracts for Communication, Monitoring, and Security (NII Shonan Meeting 2014-6).
NII Shonan Meet. Rep., 2014

Propositions as sessions.
J. Funct. Program., 2014

Query shredding: Efficient relational evaluation of queries over nested multisets (extended version).
CoRR, 2014

Query shredding: efficient relational evaluation of queries over nested multisets.
Proceedings of the International Conference on Management of Data, 2014

Effective quotation: relating approaches to language-integrated query.
Proceedings of the ACM SIGPLAN 2014 workshop on Partial evaluation and program manipulation, 2014

You and Your Research and the Elements of Style.
Proceedings of the 2014 Imperial College Computing Student Workshop, 2014

Typecasting actors: from Akka to TAkka.
Proceedings of the Fifth Annual Scala Workshop, 2014

2013
Principles of POPL.
SIGPLAN Notices, 2013

Effective Quotation.
CoRR, 2013

A practical theory of language-integrated query.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

2012
Propositions as sessions.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012

2011
Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous.
Electr. Notes Theor. Comput. Sci., 2011

Blame for all.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

2010
The arrow calculus.
J. Funct. Program., 2010

Threesomes, with and without blame.
Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2010

The Audacity of Hope: Thoughts on Reclaiming the Database Dream.
Proceedings of the Programming Languages and Systems, 2010

2009
Monadic constraint programming.
J. Funct. Program., 2009

The RPC calculus.
Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2009

Well-Typed Programs Can't Be Blamed.
Proceedings of the Programming Languages and Systems, 2009

2008
The Essence of Form Abstraction.
Proceedings of the Programming Languages and Systems, 6th Asian Symposium, 2008

2007
The Girard-Reynolds isomorphism (second edition).
Theor. Comput. Sci., 2007

Preface.
Theor. Comput. Sci., 2007

A history of Haskell: being lazy with class.
Proceedings of the Third ACM SIGPLAN History of Programming Languages Conference (HOPL-III), 2007

Comprehensive comprehensions.
Proceedings of the ACM SIGPLAN Workshop on Haskell, 2007

07051 Abstracts Collection -- Programming Paradigms for the Web: Web Programming and Web Services.
Proceedings of the Programming Paradigms for the Web: Web Programming and Web Services, 28.01., 2007

07051 Working Group Outcomes -- Programming Paradigms for the Web: Web Programming and Web Services.
Proceedings of the Programming Paradigms for the Web: Web Programming and Web Services, 28.01., 2007

07051 Executive Summary -- Programming Paradigms for the Web: Web Programming and Web Services.
Proceedings of the Programming Paradigms for the Web: Web Programming and Web Services, 28.01., 2007

2006
Faith, evolution, and programming languages: from Haskell to Java to links.
Proceedings of the Companion to the 21th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2006

Links: Web Programming Without Tiers.
Proceedings of the Formal Methods for Components and Objects, 5th International Symposium, 2006

Java generics and collections.
O'Reilly, ISBN: 978-0-596-52775-4, 2006

2005
Call-by-Value Is Dual to Call-by-Name - Reloaded.
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

2003
The marriage of effects and monads.
ACM Trans. Comput. Log., 2003

Call-by-value is dual to call-by-name.
SIGPLAN Notices, 2003

The Educational Pearls column.
J. Funct. Program., 2003

The Girard-Reynolds isomorphism.
Inf. Comput., 2003

The essence of XML.
Proceedings of the Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003

Call-by-value is dual to call-by-name.
Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003

2002
MSL: a model for W3C XML Schema.
Computer Networks, 2002

The Essence of XML (Preliminary Version).
Proceedings of the Functional and Logic Programming, 6th International Symposium, 2002

XQuery: A Typed Functional Language for Querying XML.
Proceedings of the Advanced Functional Programming, 2002

2001
Featherweight Java: a minimal core calculus for Java and GJ.
ACM Trans. Program. Lang. Syst., 2001

MSL - a model for W3C XML schema.
Proceedings of the Tenth International World Wide Web Conference, 2001

Et tu, XML? The downfall of the relational empire (abstract).
Proceedings of the VLDB 2001, 2001

The Girard-Reynolds Isomorphism.
Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001

A Semi-monad for Semi-structured Data.
Proceedings of the Database Theory, 2001

2000
A Formal Semantics of Patterns in XSLT and XPath.
Markup Languages, 2000

An Algebra for XML Query.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999
Operational Interpretations of Linear Logic.
Theor. Comput. Sci., 1999

Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus.
Theor. Comput. Sci., 1999

Featherwieght Java: A Minimal Core Calculus for Java and GJ.
Proceedings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming Systems, 1999

1998
Why No One Uses Functional Languages.
SIGPLAN Notices, 1998

An Angry Half-Dozen.
SIGPLAN Notices, 1998

The Call-by-Need Lambda Calculus.
J. Funct. Program., 1998

Making the Future Safe for the Past: Adding Genericity to the Java Programming Language.
Proceedings of the 1998 ACM SIGPLAN Conference on Object-Oriented Programming Systems, 1998

How to solve the reuse problem? Functional programming.
Proceedings of the Fifth International Conference on Software Reuse, 1998

Leftover curry and reheated Pizza: how functional programming nourishes software reuse.
Proceedings of the Fifth International Conference on Software Reuse, 1998

The Marriage of Effects and Monads.
Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP '98), 1998

A Statically Safe Alternative to Virtual Types.
Proceedings of the ECOOP'98, 1998

Two Ways to Bake Your Pizza - Translating Parameterised Types into Java.
Proceedings of the Generic Programming, 1998

1997
A Reflection on Call-by-Value.
ACM Trans. Program. Lang. Syst., 1997

How to Declare an Imperative.
ACM Comput. Surv., 1997

Pizza into Java: Translating Theory into Practice.
Proceedings of the Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997

A Practical Subtyping System For Erlang.
Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP '97), 1997

Functional Programming: An Angry Half-Dozen.
Proceedings of the Database Programming Languages, 6th International Workshop, 1997

1996
Type Classes in Haskell.
ACM Trans. Program. Lang. Syst., 1996

Lazy Versus Strict.
ACM Comput. Surv., 1996

Linear Logic, Monads and the Lambda Calculus.
Proceedings of the Proceedings, 1996

A Reflection on Call-by-Value.
Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, 1996

1995
Call-by-name, call-by-value, call-by-need and the linear lambda calculus.
Electr. Notes Theor. Comput. Sci., 1995

How to Declare an Imperative.
Proceedings of the Logic Programming, 1995

The Call-by-Need Lambda Calculus.
Proceedings of the Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995

Static Analysis Refuses to Stay Still: Prospects of Static Analysis for Dynamic Allocation (Abstract)
Proceedings of the Memory Management, 1995

Once Upon a Type.
Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995

A Second Look at Overloading.
Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995

Monads for Functional Programming.
Proceedings of the Advanced Functional Programming, 1995

1994
Monads and Composable Continuations.
Lisp and Symbolic Computation, 1994

Type Classes in Haskell.
Proceedings of the Programming Languages and Systems, 1994

1993
Functional Programming in Education - Introduction.
J. Funct. Program., 1993

Imperative Functional Programming.
Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

A Syntax for Linear Logic.
Proceedings of the Mathematical Foundations of Programming Semantics, 1993

A Taste of Linear Logic.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
Report on the Programming Language Haskell, A Non-strict, Purely Functional Language.
SIGPLAN Notices, 1992

SIGPLAN Notices Special Issue on the Functional Programming Language Haskell.
SIGPLAN Notices, 1992

Comprehending Monads.
Mathematical Structures in Computer Science, 1992

The Essence of Functional Programming.
Proceedings of the Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1992

Monads for functional programming.
Proceedings of the Program Design Calculi, Proceedings of the NATO Advanced Study Institute on Program Design Calculi, Marktoberdorf, Germany, July 28, 1992

Deforestation for Higher-Order Functions.
Proceedings of the Functional Programming, 1992

Avoiding Unnecessary Updates.
Proceedings of the Functional Programming, 1992

Combining Monads.
Proceedings of the Functional Programming, 1992

The Glasgow Haskell Compiler: A Retrospective.
Proceedings of the Functional Programming, 1992

Einführung in die funktionale Programmierung.
Hanser Studienbücher der Informatik, Hanser, ISBN: 978-3-446-17001-8, 1992

1991
Is There a Use for Linear Logic?
Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1991

1990
Deforestation: Transforming Programs to Eliminate Trees.
Theor. Comput. Sci., 1990

Comprehending Monads.
LISP and Functional Programming, 1990

1989
How to Make ad-hoc Polymorphism Less ad-hoc.
Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

Theorems for Free!
Proceedings of the fourth international conference on Functional programming languages and computer architecture, 1989

Backwards Strictness Analysis: Proved and Improved.
Proceedings of the Functional Programming, 1989

1988
Strictness Analysis Aids Time Analysis.
Proceedings of the Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988

Deforestation: Transforming Programs to Eliminate Trees.
Proceedings of the ESOP '88, 1988

Introduction to functional programming.
Prentice Hall International series in computer science, Prentice Hall, ISBN: 978-0-13-484197-7, 1988

1987
Fixing some Space Leaks with a Garbage Collector.
Softw., Pract. Exper., 1987

A critique of Abelson and Sussman or why calculating is better than scheming.
SIGPLAN Notices, 1987

Views: A Way for Pattern Matching to Cohabit with Data Abstraction.
Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

Projections for strictness analysis.
Proceedings of the Functional Programming Languages and Computer Architecture, 1987

1986
A new array operation.
Proceedings of the Graph Reduction, Proceedings of a Workshop, Santa Fé, New Mexico, USA, September 29, 1986

1985
A Simple Language is also a Functional Language.
Softw., Pract. Exper., 1985

Listlessness is better than laziness II: composing listless functions.
Proceedings of the Programs as Data Objects, 1985

How to Replace Failure by a List of Successes: A method for exception handling, backtracking, and pattern matching in lazy functional languages.
Proceedings of the Functional Programming Languages and Computer Architecture, 1985

1984
Listlessness is Better than Laziness: Lazy Evaluation and Garbage Collection at Compile Time.
LISP and Functional Programming, 1984

1981
Applicative style programming, program transformation, and list operators.
Proceedings of the 1981 conference on Functional programming languages and computer architecture, 1981

1980
Experience with an Applicative String Processing Language.
Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980

1976
Analysis of an Algorithm for Real Time Garbage Collection.
Commun. ACM, 1976


  Loading...