John N. Crossley

Publication Activity (10 Years)

Years Active: 1963-2006
Publications (10 Years): 0

Publications

Stuart Allen, John N. Crossley, Kung-Kiu Lau, Iman Poernomo
Preface. Electron. Notes Theor. Comput. Sci. 153 (1) (2006)
Matthias M. Hölzl, John N. Crossley
Disjunctive Constraint Lambda Calculi. LPAR (2005)
John N. Crossley
Declarative N. Programming: A logical view. Electron. Notes Theor. Comput. Sci. 61 (2002)
Matthias M. Hölzl, John N. Crossley
Constraint-Lambda Calculi. FroCoS (2002)
Iman Poernomo, John N. Crossley, Martin Wirsing
Programs, Proofs and Parametrized Specifications. WADT (2001)
John N. Crossley, Iman Poernomo
Fred: An Approach to Generating Real, Correct, Reusable Programs from Proofs. J. Univers. Comput. Sci. 7 (1) (2001)
Iman Poernomo, John N. Crossley
Protocols between programs and proofs. LOPSTR (2000)
Iman Poernomo, John N. Crossley
Protocols between Programs and Proofs. LOPSTR (LNCS 2042: Selected Papers) (2000)
John N. Crossley, Iman Poernomo, Martin Wirsing
Extraction of Structured Programs from Specification Proofs. WADT (1999)
Frank A. Bäuerle, David W. Albrecht, John N. Crossley, John S. Jeavons
Curry-Howard Terms for Linear Logic. Stud Logica 61 (2) (1998)
Martin Wirsing, John N. Crossley, Hannes Peterreins
Proof Normalization of Structured Algebraic Specifications Is Convergent. WADT (1998)
David W. Albrecht, John N. Crossley, John S. Jeavons
New Curry-Howard Terms for Full Linear Logic. Theor. Comput. Sci. 185 (2) (1997)
John N. Crossley, Luis Mandel, Martin Wirsing
First-Order Constrained Lambda Calculus. FroCoS (1996)
John N. Crossley
Practical Logic (Abstract). ISAAC (1995)
John N. Crossley, Gerald L. Mathai, Robert A. G. Seely
A logical calculus for polynomial-time realizability. Methods Log. Comput. Sci. 1 (3) (1994)
John N. Crossley, Jeffrey B. Remmel
Proofs, programs, and run times. Methods Log. Comput. Sci. 1 (2) (1994)
John N. Crossley, Jeffrey B. Remmel
Cancellation Laws for Polynomial-Time p-Isolated Sets. Ann. Pure Appl. Log. 56 (1-3) (1992)
John N. Crossley, Pierre Lim, Peter J. Stuckey
Interface Logic Programming. Aust. Comput. J. 21 (2) (1989)
John N. Crossley, Philip J. Scott
Completeness Proofs for Propositional Logic with Polynomial-Time Connectives. Ann. Pure Appl. Log. 44 (1-2) (1989)
John N. Crossley, Jane Bridge Kister
Natural well-orderings. Arch. Math. Log. 26 (1) (1987)
John N. Crossley
Preface. Ann. Pure Appl. Log. 32 (1986)
John N. Crossley, Alfred B. Manaster, Michael F. Moses
Recursive categoricity and recursive stability. Ann. Pure Appl. Log. 31 (1986)
John N. Crossley, Lloyd Humberstone
Meeting of the Association for Symbolic Logic: Melbourne, Australia 1979. J. Symb. Log. 46 (2) (1981)
John N. Crossley
Meeting of the Association for Symbolic Logic. J. Symb. Log. 31 (2) (1966)
John N. Crossley
Constructive Order Types, II. J. Symb. Log. 31 (4) (1966)
E. J. Lemmon, M. A. E. Dummett, John N. Crossley
Meeting of the Association for Symbolic Logic. J. Symb. Log. 28 (3) (1963)