2006 |
21 | EE | Stuart Allen,
John N. Crossley,
Kung-Kiu Lau,
Iman Poernomo:
Preface.
Electr. Notes Theor. Comput. Sci. 153(1): 1-2 (2006) |
2005 |
20 | EE | Matthias M. Hölzl,
John N. Crossley:
Disjunctive Constraint Lambda Calculi.
LPAR 2005: 64-78 |
2002 |
19 | EE | Matthias M. Hölzl,
John N. Crossley:
Constraint-Lambda Calculi.
FroCos 2002: 207-221 |
18 | EE | John N. Crossley:
Declarative N. Programming: A logical view.
Electr. Notes Theor. Comput. Sci. 61: (2002) |
2001 |
17 | EE | Iman Poernomo,
John N. Crossley,
Martin Wirsing:
Programs, Proofs and Parametrized Specifications.
WADT 2001: 280-304 |
16 | EE | John N. Crossley,
Iman Poernomo:
Fred: An Approach to Generating Real, Correct, Reusable Programs from Proofs.
J. UCS 7(1): 71-88 (2001) |
2000 |
15 | EE | Iman Poernomo,
John N. Crossley:
Protocols between programs and proofs.
LOPSTR 2000 |
14 | EE | Iman Poernomo,
John N. Crossley:
Protocols between Programs and Proofs.
LOPSTR (LNCS 2042: Selected Papers) 2000: 18-37 |
1999 |
13 | | John N. Crossley,
Iman Poernomo,
Martin Wirsing:
Extraction of Structured Programs from Specification Proofs.
WADT 1999: 419-437 |
1998 |
12 | EE | Martin Wirsing,
John N. Crossley,
Hannes Peterreins:
Proof Normalization of Structured Algebraic Specifications Is Convergent.
WADT 1998: 326-340 |
11 | | Frank A. Bäuerle,
David W. Albrecht,
John N. Crossley,
John S. Jeavons:
Curry-Howard Terms for Linear Logic.
Studia Logica 61(2): 223-235 (1998) |
1997 |
10 | EE | David W. Albrecht,
John N. Crossley,
John S. Jeavons:
New Curry-Howard Terms for Full Linear Logic.
Theor. Comput. Sci. 185(2): 217-235 (1997) |
1996 |
9 | | John N. Crossley,
Luis Mandel,
Martin Wirsing:
First-Order Constrained Lambda Calculus.
Frontiers of Combining Systems (FroCos) 1996: 339-356 |
1995 |
8 | | John N. Crossley:
Practical Logic (Abstract).
ISAAC 1995: 162 |
1992 |
7 | | John N. Crossley,
Jeffrey B. Remmel:
Cancellation Laws for Polynomial-Time p-Isolated Sets.
Ann. Pure Appl. Logic 56(1-3): 147-172 (1992) |
1989 |
6 | | John N. Crossley,
Philip J. Scott:
Completeness Proofs for Propositional Logic with Polynomial-Time Connectives.
Ann. Pure Appl. Logic 44(1-2): 39-52 (1989) |
5 | | John N. Crossley,
Pierre Lim,
Peter J. Stuckey:
Interface Logic Programming.
Australian Computer Journal 21(2): 49-55 (1989) |
1981 |
4 | | John N. Crossley,
Lloyd Humberstone:
Meeting of the Association for Symbolic Logic: Melbourne, Australia 1979.
J. Symb. Log. 46(2): 424-426 (1981) |
1966 |
3 | | John N. Crossley:
Meeting of the Association for Symbolic Logic.
J. Symb. Log. 31(2): 290-302 (1966) |
2 | | John N. Crossley:
Constructive Order Types, II.
J. Symb. Log. 31(4): 525-538 (1966) |
1963 |
1 | | E. J. Lemmon,
M. A. E. Dummett,
John N. Crossley:
Meeting of the Association for Symbolic Logic.
J. Symb. Log. 28(3): 262-272 (1963) |