John Newsome Crossley

According to our database, John Newsome Crossley authored at least 35 papers between 1963 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

What is mathematical logic? An Australian odyssey.

John Newsome Crossley

Log. J. IGPL, November, 2023

2015

Logics Modulo Theories: a logical framework for multi-agent systems.

Lito Perez Cruz, John Newsome Crossley

Log. J. IGPL, 2015

2012

LMT: A Lightweight Logical Framework for Multi-agent Systems.

John Newsome Crossley, Lito Perez Cruz

Proceedings of the Advances in Knowledge-Based and Intelligent Information and Engineering Systems, 2012

2011

What Is the Difference Between Proofs and Programs?

John N. Crossley

Proceedings of the Proof, Computation and Agency - Logic at the Crossroads., 2011

What Is a Proof?

John N. Crossley

Proceedings of the Proof, Computation and Agency - Logic at the Crossroads., 2011

What Is Mathematical Logic? A Survey.

John N. Crossley

Proceedings of the Proof, Computation and Agency - Logic at the Crossroads., 2011

2010

Contextualizing Ontologies for Agents.

Lito Perez Cruz, John Newsome Crossley

Proceedings of the KEOD 2010, 2010

2009

Tiered Logic for Agents in Contexts.

Rosalito Perez Cruz, John Newsome Crossley

Proceedings of the Agents and Artificial Intelligence - International Conference, 2009

Tiered Logic for Agents.

Rosalito Perez Cruz, John Newsome Crossley

Proceedings of the ICAART 2009 - Proceedings of the International Conference on Agents and Artificial Intelligence, Porto, Portugal, January 19, 2009

2005

Adapting Proofs-as-Programs - The Curry-Howard Protocol

Iman Hafiz Poernomo, Martin Wirsing, John Newsome Crossley

Monographs in Computer Science, Springer, ISBN: 978-0-387-28183-4, 2005

Preface.

Stuart Allen, John N. Crossley, Kung-Kiu Lau, Iman Poernomo

Proceedings of the Workshop on the Constructive Logic for Automated Software Engineering, 2005

Disjunctive Constraint Lambda Calculi.

Matthias M. Hölzl, John N. Crossley

Proceedings of the Logic for Programming, 2005

2002

Declarative N. Programming: A logical view.

John N. Crossley

Proceedings of the Computing: the Australasian Theory Symposium, 2002

Constraint-Lambda Calculi.

Matthias M. Hölzl, John N. Crossley

Proceedings of the Frontiers of Combining Systems, 4th International Workshop, 2002

2001

Fred: An Approach to Generating Real, Correct, Reusable Programs from Proofs.

John N. Crossley, Iman Poernomo

J. Univers. Comput. Sci., 2001

Programs, Proofs and Parametrized Specifications.

Iman Poernomo, John N. Crossley, Martin Wirsing

Proceedings of the Recent Trends in Algebraic Development Techniques, 2001

2000

Protocols between Programs and Proofs.

Iman Poernomo, John N. Crossley

Proceedings of the Logic Based Program Synthesis and Transformation, 2000

1999

Extraction of Structured Programs from Specification Proofs.

John N. Crossley, Iman Poernomo, Martin Wirsing

Proceedings of the Recent Trends in Algebraic Development Techniques, 1999

1998

Curry-Howard Terms for Linear Logic.

Frank A. Bäuerle, David W. Albrecht, John N. Crossley, John S. Jeavons

Stud Logica, 1998

Proof Normalization of Structured Algebraic Specifications Is Convergent.

Martin Wirsing, John N. Crossley, Hannes Peterreins

Proceedings of the Recent Trends in Algebraic Development Techniques, 1998

1997

New Curry-Howard Terms for Full Linear Logic.

David W. Albrecht, John N. Crossley, John S. Jeavons

Theor. Comput. Sci., 1997

1996

First-Order Constrained Lambda Calculus.

John N. Crossley, Luis Mandel, Martin Wirsing

Proceedings of the Frontiers of Combining Systems, 1996

1995

Practical Logic (Abstract).

John N. Crossley

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994

Proofs, programs, and run times.

John N. Crossley, Jeffrey B. Remmel

Methods Log. Comput. Sci., 1994

A logical calculus for polynomial-time realizability.

John N. Crossley, Gerald L. Mathai, Robert A. G. Seely

Methods Log. Comput. Sci., 1994

1992

Cancellation Laws for Polynomial-Time p-Isolated Sets.

John N. Crossley, Jeffrey B. Remmel

Ann. Pure Appl. Log., 1992

1989

Completeness Proofs for Propositional Logic with Polynomial-Time Connectives.

John N. Crossley, Philip J. Scott

Ann. Pure Appl. Log., 1989

Interface Logic Programming.

John N. Crossley, Pierre Lim, Peter J. Stuckey

Aust. Comput. J., 1989

1987

Natural well-orderings.

John N. Crossley, Jane Bridge Kister

Arch. Math. Log., 1987

1986

Recursive categoricity and recursive stability.

John N. Crossley, Alfred B. Manaster, Michael F. Moses

Ann. Pure Appl. Log., 1986

Preface.

John N. Crossley

Ann. Pure Appl. Log., 1986

1981

Meeting of the Association for Symbolic Logic: Melbourne, Australia 1979.

John N. Crossley, Lloyd Humberstone

J. Symb. Log., 1981

1966

Constructive Order Types, II.

John N. Crossley

J. Symb. Log., 1966

Meeting of the Association for Symbolic Logic.

John N. Crossley

J. Symb. Log., 1966

1963

Meeting of the Association for Symbolic Logic.

E. J. Lemmon, M. A. E. Dummett, John N. Crossley

J. Symb. Log., 1963