John Newsome Crossley

发表

First-Order Constrained Lambda Calculus

Luis Mandel, Martin Wirsing, John Newsome Crossley, 1996, FroCoS.

Natural well-orderings

John Newsome Crossley, Jane Bridge Kister, J. Crossley, 1987, Arch. Math. Log..

Tiered Logic for Agents

John Newsome Crossley, Lito Perez Cruz, J. Crossley, 2009, ICAART.

Preface

John Newsome Crossley, 1986, Ann. Pure Appl. Log..

Constraint-Lambda Calculi

John Newsome Crossley, Matthias M. Hölzl, 2002, FroCoS.

Protocols between programs and proofs

John Newsome Crossley, Iman Poernomo, 2000, LOPSTR.

Curry-Howard Terms for Linear Logic

David W. Albrecht, John Newsome Crossley, John S. Jeavons, 1998, Stud Logica.

LMT: A Lightweight Logical Framework for Multi-agent Systems

John Newsome Crossley, Lito Perez Cruz, J. Crossley, 2012, KES.

Recursive categoricity and recursive stability

John Newsome Crossley, Alfred B. Manaster, Michael F. Moses, 1986, Ann. Pure Appl. Log..

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

John Newsome Crossley, Iman Poernomo, 2001, J. Univers. Comput. Sci..

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

John Newsome Crossley, Lloyd Humberstone, 1981, J. Symb. Log..

Interface Logic Programming

Peter J. Stuckey, John Newsome Crossley, Pierre Lim, 1989, Aust. Comput. J..

Practical Logic (Abstract)

John Newsome Crossley, 1995, ISAAC.

Tiered Logic for Agents in Contexts

John Newsome Crossley, Lito Perez Cruz, J. Crossley, 2009, ICAART.

Meeting of the Association for Symbolic Logic

John Newsome Crossley, 1963, J. Symb. Log..

Programs, Proofs and Parametrized Specifications

Martin Wirsing, John Newsome Crossley, Iman Poernomo, 2001, WADT.

Contextualizing Ontologies for Agents

John Newsome Crossley, Lito Perez Cruz, J. Crossley, 2010, KEOD.

Cancellation Laws for Polynomial-Time p-Isolated Sets

Jeffrey B. Remmel, John Newsome Crossley, 1992, Ann. Pure Appl. Log..

What Is the Difference Between Proofs and Programs?

John Newsome Crossley, 2011, Proof, Computation and Agency.

Extraction of Structured Programs from Specification Proofs

Martin Wirsing, John Newsome Crossley, Iman Poernomo, 1999, WADT.

Constructive Order Types, II

John Newsome Crossley, J. N. Crossley, 1966, J. Symb. Log..

Preface

Kung-Kiu Lau, John Newsome Crossley, Iman Poernomo, 2005, CLASE.

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

John Newsome Crossley, Lito Perez Cruz, J. Crossley, 2015, Log. J. IGPL.

What Is Mathematical Logic? A Survey

John Newsome Crossley, 2011, Proof, Computation and Agency.

Proof Normalization of Structured Algebraic Specifications Is Convergent

Martin Wirsing, John Newsome Crossley, Hannes Peterreins, 1998, WADT.

Proofs, programs, and run times

Jeffrey B. Remmel, John Newsome Crossley, 1994, Methods Log. Comput. Sci..

A logical calculus for polynomial-time realizability

John Newsome Crossley, Robert A. G. Seely, Gerald L. Mathai, 1994, Methods Log. Comput. Sci..

Disjunctive Constraint Lambda Calculi

John Newsome Crossley, Matthias M. Hölzl, J. Crossley, 2005, LPAR.

Algebra and Logic

John Newsome Crossley, J. Crossley, 1975 .

New Curry-Howard Terms for Full Linear Logic

David W. Albrecht, John Newsome Crossley, John S. Jeavons, 1997, Theor. Comput. Sci..

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

Martin Wirsing, John Newsome Crossley, Iman Poernomo, 2005, Monographs in Computer Science.

Completeness Proofs for Propositional Logic with Polynomial-Time Connectives

John Newsome Crossley, Philip J. Scott, 1989, Ann. Pure Appl. Log..