The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin W. Bunder: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jianyong Huang, Jennifer Seberry, Willy Susilo, Martin W. Bunder
    Security Analysis of Michael: The IEEE 802.11i Message Integrity Code. [Citation Graph (0, 0)][DBLP]
    EUC Workshops, 2005, pp:423-432 [Conf]
  2. Martin W. Bunder, Keith Tognetti
    On the self matching properties of [j tau]. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:241, n:1-3, pp:139-151 [Journal]
  3. Martin W. Bunder
    Intersection types for lambda-terms and combinators and their logics. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2002, v:10, n:4, pp:357-378 [Journal]
  4. Martin W. Bunder, Jonathan P. Seldin
    Variants of the basic calculus of constructions. [Citation Graph (0, 0)][DBLP]
    J. Applied Logic, 2004, v:2, n:2, pp:191-217 [Journal]
  5. Robert K. Meyer, Martin W. Bunder, Lawrence Powers
    Implementing the `Fool's Model' of Combinatory Logic. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1991, v:7, n:4, pp:597-630 [Journal]
  6. Martin W. Bunder
    A Simplified Form of Condensed Detachment. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 1995, v:4, n:2, pp:169-173 [Journal]
  7. Henk Barendregt, Martin W. Bunder, Wil Dekkers
    Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:3, pp:769-788 [Journal]
  8. Martin W. Bunder
    Expedited Broda-Damas Bracket Abstraction. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:4, pp:1850-1857 [Journal]
  9. Martin W. Bunder
    A Classification of Intersection Type Systems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:1, pp:353-368 [Journal]
  10. Martin W. Bunder
    The Inconsistency of F * 21. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:2, pp:467-468 [Journal]
  11. Martin W. Bunder
    Consistency Notions in Illative Combinatory Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1977, v:42, n:4, pp:527-529 [Journal]
  12. Martin W. Bunder
    A Weak Absolute Consistency Proof for Some Systems of Illative Combinatory Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1983, v:48, n:3, pp:771-776 [Journal]
  13. Martin W. Bunder
    Some Consistency Proofs and a Characterization of Inconsistency Proofs in Illative Combinatory Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1987, v:52, n:1, pp:89-110 [Journal]
  14. Martin W. Bunder
    Some Improvements to Turner's Algorithm for Bracket Abstraction. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1990, v:55, n:2, pp:656-669 [Journal]
  15. Martin W. Bunder, Wil Dekkers
    Pure Type Systems with More Liberal Rules. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:4, pp:1561-1580 [Journal]
  16. Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin
    On Adding (xi) to Weak Equality in Combinatory Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:2, pp:590-607 [Journal]
  17. Martin W. Bunder, Robert K. Meyer
    On the Inconsistency of Systems Similar to F * 21. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1978, v:43, n:1, pp:1-2 [Journal]
  18. Martin W. Bunder, Jonathan P. Seldin
    Some Anomalies in Fitch's System QD. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1978, v:43, n:2, pp:247-249 [Journal]
  19. Wil Dekkers, Martin W. Bunder, Henk Barendregt
    Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic into Illative Combinatory Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:3, pp:869-890 [Journal]
  20. Martin W. Bunder
    Proof finding algorithms for implicational logics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:232, n:1-2, pp:165-186 [Journal]
  21. Martin W. Bunder
    An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair Combinators. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:337-342 [Journal]
  22. Martin W. Bunder
    Possible Forms of Evaluation or Reduction in Martin-Löf Type Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:113-120 [Journal]
  23. Martin W. Bunder
    Lambda Terms Definable as Combinators. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:169, n:1, pp:3-21 [Journal]
  24. Martin W. Bunder, J. Roger Hindley
    Two beta-Equal lambda-I-Terms with no Types in Common. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:155, n:1, pp:265-266 [Journal]
  25. P. Trigg, J. Roger Hindley, Martin W. Bunder
    Combinatory Abstraction Bsing B, B' and Friends. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:135, n:2, pp:405-422 [Journal]
  26. Martin W. Bunder, Wil Dekkers
    Are there Hilbert-style Pure Type Systems? [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  27. The Inhabitation Problem for Intersection Types. [Citation Graph (, )][DBLP]


  28. Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus. [Citation Graph (, )][DBLP]


  29. On binary reflected Gray codes and functions. [Citation Graph (, )][DBLP]


  30. Locating terms in the Stern-Brocot tree. [Citation Graph (, )][DBLP]


  31. Linking the Calkin-Wilf and Stern-Brocot trees. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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