default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Newsome Crossley
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]John Newsome Crossley
:
What is mathematical logic? An Australian odyssey. Log. J. IGPL 31(6): 1010-1022 (2023)
2010 – 2019
- 2015
- [j16]Lito Perez Cruz, John Newsome Crossley:
Logics Modulo Theories: a logical framework for multi-agent systems. Log. J. IGPL 23(4): 553-583 (2015) - 2012
- [c15]John Newsome Crossley, Lito Perez Cruz:
LMT: A Lightweight Logical Framework for Multi-agent Systems. KES 2012: 118-127 - 2011
- [p3]John N. Crossley:
What Is Mathematical Logic? A Survey. Proof, Computation and Agency 2011: 3-17 - [p2]John N. Crossley:
What Is a Proof? Proof, Computation and Agency 2011: 35-52 - [p1]John N. Crossley:
What Is the Difference Between Proofs and Programs? Proof, Computation and Agency 2011: 81-97 - 2010
- [c14]Lito Perez Cruz, John Newsome Crossley:
Contextualizing Ontologies for Agents. KEOD 2010: 147-152
2000 – 2009
- 2009
- [c13]Rosalito Perez Cruz, John Newsome Crossley:
Tiered Logic for Agents in Contexts. ICAART (Revised Selected Papers) 2009: 191-204 - [c12]Rosalito Perez Cruz, John Newsome Crossley:
Tiered Logic for Agents. ICAART 2009: 369-376 - 2006
- [e1]Stuart Allen, John N. Crossley, Kung-Kiu Lau, Iman Poernomo:
Proceedings of the Workshop on the Constructive Logic for Automated Software Engineering, CLASE 2005, Edinburgh, UK, April 9, 2005. Electronic Notes in Theoretical Computer Science 153(1), Elsevier 2006 [contents] - 2005
- [b1]Iman Hafiz Poernomo, Martin Wirsing, John Newsome Crossley:
Adapting Proofs-as-Programs - The Curry-Howard Protocol. Monographs in Computer Science, Springer 2005, ISBN 978-0-387-23759-6, pp. 1-396 - [c11]Matthias M. Hölzl, John N. Crossley:
Disjunctive Constraint Lambda Calculi. LPAR 2005: 64-78 - [c10]Stuart Allen, John N. Crossley, Kung-Kiu Lau, Iman Poernomo:
Preface. CLASE 2005: 1-2 - 2002
- [c9]Matthias M. Hölzl, John N. Crossley:
Constraint-Lambda Calculi. FroCoS 2002: 207-221 - [c8]John N. Crossley:
Declarative N. Programming: A logical view. CATS 2002: 20 - 2001
- [j15]John N. Crossley, Iman Poernomo:
Fred: An Approach to Generating Real, Correct, Reusable Programs from Proofs. J. Univers. Comput. Sci. 7(1): 71-88 (2001) - [c7]Iman Poernomo, John N. Crossley, Martin Wirsing:
Programs, Proofs and Parametrized Specifications. WADT 2001: 280-304 - 2000
- [c6]Iman Poernomo, John N. Crossley:
Protocols between programs and proofs. LOPSTR 2000 - [c5]Iman Poernomo, John N. Crossley:
Protocols between Programs and Proofs. LOPSTR (LNCS 2042: Selected Papers) 2000: 18-37
1990 – 1999
- 1999
- [c4]John N. Crossley, Iman Poernomo, Martin Wirsing:
Extraction of Structured Programs from Specification Proofs. WADT 1999: 419-437 - 1998
- [j14]Frank A. Bäuerle, David W. Albrecht, John N. Crossley, John S. Jeavons:
Curry-Howard Terms for Linear Logic. Stud Logica 61(2): 223-235 (1998) - [c3]Martin Wirsing, John N. Crossley, Hannes Peterreins:
Proof Normalization of Structured Algebraic Specifications Is Convergent. WADT 1998: 326-340 - 1997
- [j13]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
- [c2]John N. Crossley, Luis Mandel, Martin Wirsing:
First-Order Constrained Lambda Calculus. FroCoS 1996: 339-356 - 1995
- [c1]John N. Crossley:
Practical Logic (Abstract). ISAAC 1995: 162 - 1994
- [j12]John N. Crossley, Jeffrey B. Remmel:
Proofs, programs, and run times. Methods Log. Comput. Sci. 1(2): 183-215 (1994) - [j11]John N. Crossley, Gerald L. Mathai, Robert A. G. Seely:
A logical calculus for polynomial-time realizability. Methods Log. Comput. Sci. 1(3): 279-298 (1994) - 1992
- [j10]John N. Crossley, Jeffrey B. Remmel:
Cancellation Laws for Polynomial-Time p-Isolated Sets. Ann. Pure Appl. Log. 56(1-3): 147-172 (1992)
1980 – 1989
- 1989
- [j9]John N. Crossley, Pierre Lim, Peter J. Stuckey:
Interface Logic Programming. Aust. Comput. J. 21(2): 49-55 (1989) - [j8]John N. Crossley, Philip J. Scott:
Completeness Proofs for Propositional Logic with Polynomial-Time Connectives. Ann. Pure Appl. Log. 44(1-2): 39-52 (1989) - 1987
- [j7]John N. Crossley, Jane Bridge Kister:
Natural well-orderings. Arch. Math. Log. 26(1): 57-76 (1987) - 1986
- [j6]John N. Crossley, Alfred B. Manaster, Michael F. Moses:
Recursive categoricity and recursive stability. Ann. Pure Appl. Log. 31: 191-204 (1986) - [j5]John N. Crossley:
Preface. Ann. Pure Appl. Log. 32: 111 (1986) - 1981
- [j4]John N. Crossley, Lloyd Humberstone:
Meeting of the Association for Symbolic Logic: Melbourne, Australia 1979. J. Symb. Log. 46(2): 424-426 (1981)
1960 – 1969
- 1966
- [j3]John N. Crossley:
Meeting of the Association for Symbolic Logic. J. Symb. Log. 31(2): 290-302 (1966) - [j2]John N. Crossley:
Constructive Order Types, II. J. Symb. Log. 31(4): 525-538 (1966) - 1963
- [j1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
