The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

John N. Crossley: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.004secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002