| |
| * | 2008 | |
|---|---|---|
| 10 | EE | John Longley: Interpreting Localized Computational Effects Using Operators of Higher Type. CiE 2008: 389-402 |
| 2007 | ||
| 9 | EE | John Longley: On the ubiquity of certain total type structures. Mathematical Structures in Computer Science 17(5): 841-953 (2007) |
| 2004 | ||
| 8 | EE | John Longley, Randy Pollack: Reasoning About CBV Functional Programs in Isabelle/HOL. TPHOLs 2004: 201-216 |
| 7 | EE | John Longley: On the Ubiquity of Certain Total Type Structures: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 73: 87-109 (2004) |
| 2002 | ||
| 6 | John Longley: The sequentially realizable functionals. Ann. Pure Appl. Logic 117(1-3): 1-93 (2002) | |
| 2000 | ||
| 5 | EE | Furio Honsell, John Longley, Donald Sannella, Andrzej Tarlecki: Constructive Data Refinement in Typed Lambda Calculus. FoSSaCS 2000: 161-176 |
| 4 | EE | John Longley: Matching typed and untyped realizability. Electr. Notes Theor. Comput. Sci. 35: (2000) |
| 1999 | ||
| 3 | EE | John Longley: When is a Functional Program Not a Functional Program? ICFP 1999: 1-7 |
| 2 | EE | John Longley: Matching typed and untyped realizability. Electr. Notes Theor. Comput. Sci. 23(1): (1999) |
| 1997 | ||
| 1 | Simon Finn, Michael P. Fourman, John Longley: Partial Functions in a Total Setting. J. Autom. Reasoning 18(1): 85-104 (1997) | |
| 1 | Simon Finn | [1] |
| 2 | Michael P. Fourman | [1] |
| 3 | Furio Honsell | [5] |
| 4 | Randy Pollack | [8] |
| 5 | Donald Sannella | [5] |
| 6 | Andrzej Tarlecki | [5] |