| 2008 |
|---|
| 44 | EE | Matthew Collinson,
David J. Pym,
Edmund Robinson:
Bunched polymorphism.
Mathematical Structures in Computer Science 18(6): 1091-1132 (2008) |
| 2007 |
|---|
| 43 | EE | Guy McCusker,
David J. Pym:
A Games Model of Bunched Implications.
CSL 2007: 573-588 |
| 42 | EE | David J. Pym,
Chris M. N. Tofts:
Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic.
Electr. Notes Theor. Comput. Sci. 172: 545-587 (2007) |
| 41 | EE | Matthew Collinson,
David J. Pym,
Chris M. N. Tofts:
Errata for Formal Aspects of Computing (2006) 18: 495-517 and their consequences.
Formal Asp. Comput. 19(4): 551-554 (2007) |
| 40 | EE | Carsten Führmann,
David J. Pym:
On categorical models of classical logic and the Geometry of Interaction.
Mathematical Structures in Computer Science 17(5): 957-1027 (2007) |
| 2006 |
|---|
| 39 | EE | Matthew Collinson,
David J. Pym:
Bunching for Regions and Locations.
Electr. Notes Theor. Comput. Sci. 158: 171-197 (2006) |
| 38 | EE | David J. Pym,
Chris M. N. Tofts:
A Calculus and logic of resources and processes.
Formal Asp. Comput. 18(4): 495-517 (2006) |
| 37 | EE | David J. Pym:
Editorial.
J. Log. Comput. 16(1): 1-3 (2006) |
| 2005 |
|---|
| 36 | EE | Matthew Collinson,
David J. Pym,
Edmund Robinson:
On Bunched Polymorphism.
CSL 2005: 36-50 |
| 35 | | David J. Pym,
Eike Ritter:
A games semantics for reductive logic and proof-search.
GALOP 2005: 107-123 |
| 34 | EE | David J. Pym:
Editorial.
J. Log. Comput. 15(6): 819 (2005) |
| 33 | EE | Didier Galmiche,
Daniel Méry,
David J. Pym:
The semantics of BI and resource tableaux.
Mathematical Structures in Computer Science 15(6): 1033-1088 (2005) |
| 2004 |
|---|
| 32 | EE | Carsten Führmann,
David J. Pym:
On the Geometry of Interaction for Classical Logic.
LICS 2004: 211-220 |
| 31 | EE | David J. Pym,
Peter W. O'Hearn,
Hongseok Yang:
Possible worlds and resources: the semantics of BI.
Theor. Comput. Sci. 315(1): 257-305 (2004) |
| 2003 |
|---|
| 30 | EE | James Harland,
David J. Pym:
Resource-distribution via Boolean constraints.
ACM Trans. Comput. Log. 4(1): 56-90 (2003) |
| 29 | EE | David J. Pym:
Editorial.
J. Log. Comput. 13(5): 633-638 (2003) |
| 28 | EE | David J. Pym:
Forthcoming Papers.
J. Log. Comput. 13(5): 799-800 (2003) |
| 2002 |
|---|
| 27 | EE | Didier Galmiche,
Daniel Méry,
David J. Pym:
Resource Tableaux.
CSL 2002: 183-199 |
| 26 | EE | Samin S. Ishtiaq,
David J. Pym:
Kripke Resource Models of a Dependently-typed, Bunched [lgr]-calculus.
J. Log. Comput. 12(6): 1061-1104 (2002) |
| 2001 |
|---|
| 25 | EE | Pablo A. Armelín,
David J. Pym:
Bunched Logic Programming.
IJCAR 2001: 289-304 |
| 2000 |
|---|
| 24 | EE | James Harland,
David J. Pym:
Resource-distribution via Boolean constraints
CoRR cs.LO/0012018: (2000) |
| 23 | EE | James Harland,
David J. Pym,
Michael Winikoff:
Forward and Backward Chaining in Linear Logic.
Electr. Notes Theor. Comput. Sci. 37: (2000) |
| 22 | EE | David J. Pym:
Notes Towards a Semantics for Proof-search.
Electr. Notes Theor. Comput. Sci. 37: (2000) |
| 21 | | Eike Ritter,
David J. Pym,
Lincoln A. Wallen:
Proof-terms for classical and intuitionistic resolution.
J. Log. Comput. 10(2): 173-207 (2000) |
| 20 | EE | Eike Ritter,
David J. Pym,
Lincoln A. Wallen:
On the intuitionistic force of classical search.
Theor. Comput. Sci. 232(1-2): 299-333 (2000) |
| 19 | EE | Didier Galmiche,
David J. Pym:
Proof-search in type-theoretic languages: an introduction.
Theor. Comput. Sci. 232(1-2): 5-53 (2000) |
| 1999 |
|---|
| 18 | | Samin S. Ishtiaq,
David J. Pym:
Kripke Resource Models of a Dependently-Typed, Bunched lambda-Calculus.
CSL 1999: 235-249 |
| 17 | EE | David J. Pym:
On Bunched Predicate Logic.
LICS 1999: 183-192 |
| 16 | EE | Peter W. O'Hearn,
David J. Pym:
The logic of bunched implications.
Bulletin of Symbolic Logic 5(2): 215-244 (1999) |
| 1998 |
|---|
| 15 | EE | David J. Pym:
Logic Programming with Bunched Implications.
Electr. Notes Theor. Comput. Sci. 17: (1998) |
| 14 | | Samin S. Ishtiaq,
David J. Pym:
A Relevant Analysis of Natural Deduction.
J. Log. Comput. 8(6): 809-838 (1998) |
| 1997 |
|---|
| 13 | | James Harland,
David J. Pym:
Resource-Distribution via Boolean Constraint (Extended Abstract).
CADE 1997: 222-236 |
| 1996 |
|---|
| 12 | | James Harland,
David J. Pym,
Michael Winikoff:
Programming in Lygon: An Overview.
AMAST 1996: 391-405 |
| 11 | | James Harland,
David J. Pym,
Michael Winikoff:
Programming in Lygon: A System Demonstration.
AMAST 1996: 599 |
| 10 | | Eike Ritter,
David J. Pym,
Lincoln A. Wallen:
Proof-Terms for Classical and Intuitionistic Resolution (Extended Abstract).
CADE 1996: 17-31 |
| 9 | | Eike Ritter,
David J. Pym,
Lincoln A. Wallen:
On the Intuitionistic Force of Classical Search (Extended Abstract).
TABLEAUX 1996: 295-311 |
| 1995 |
|---|
| 8 | | James Harland,
David J. Pym,
Michael Winikoff:
Programming in Lygon: A Brief Overview.
ILPS 1995: 636 |
| 7 | | David J. Pym:
A note on the proof theory of the lambda-II-calculus.
Studia Logica 54(2): 199-230 (1995) |
| 1994 |
|---|
| 6 | | David J. Pym,
James Harland:
A Uniform Proof-Theoretic Investigation of Linear Logic Programming.
J. Log. Comput. 4(2): 175-207 (1994) |
| 1992 |
|---|
| 5 | | David J. Pym,
Lincoln A. Wallen:
Logic Programming via Proof-valued Computations.
ALPUK 1992: 253-262 |
| 4 | | James Harland,
David J. Pym:
On Resolution in Fragments of Classical Linear Logic.
LPAR 1992: 30-41 |
| 3 | | David J. Pym:
A Unification Algorithm for the lambda-Pi-Calculus.
Int. J. Found. Comput. Sci. 3(3): 333-378 (1992) |
| 1991 |
|---|
| 2 | | James Harland,
David J. Pym:
The Uniform Proof-Theoretic Foundation of Linear Logic Programming.
ISLP 1991: 304-318 |
| 1990 |
|---|
| 1 | | David J. Pym,
Lincoln A. Wallen:
Investigations into Proof-Search in a System of First-Order Dependent Function Types.
CADE 1990: 236-250 |
