dblp.uni-trier.dewww.uni-trier.de

Martin W. Bunder

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

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

Coauthor Index

1Mohua Banerjee [29]
2Hendrik Pieter Barendregt (Henk Barendregt) [12] [18] [19]
3Mihir K. Chakraborty [29]
4Wil Dekkers [12] [18] [19] [22] [28]
5J. Roger Hindley [9] [13] [16]
6Jianyong Huang [27]
7Norman D. Megill [17]
8Robert K. Meyer [4] [11]
9Lawrence Powers [11]
10Jennifer Seberry (Jennifer Seberry Wallis) [27]
11Jonathan P. Seldin [3] [9] [26]
12Willy Susilo [27]
13Keith P. Tognetti [23] [30]
14P. Trigg [13]
15Glen E. Wheeler [30]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)