Wil Dekkers

	2011
9		Wil Dekkers: Weak mu-equality is decidable CoRR abs/1102.0155: (2011)
	2008
8		Martin W. Bunder, Wil Dekkers: Are there Hilbert-style Pure Type Systems? Logical Methods in Computer Science 4(1): (2008)
	2007
7		Martin W. Bunder, Wil Dekkers: Are there Hilbert-style Pure Type Systems? CoRR abs/0707.0890: (2007)
	2001
6		Martin W. Bunder, Wil Dekkers: Pure Type Systems with More Liberal Rules. J. Symb. Log. 66(4): 1561-1580 (2001)
	1998
5		Wil 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)
4		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)
	1995
3		Wil Dekkers: Inhabitation of Types in the Simply Typed Lambda Calculus Inf. Comput. 119(1): 14-17 (1995)
	1993
2		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)
	1988
1		Wil Dekkers: Reducibility of Types in Typed Lambda Calculus: Comment on a Paper by Richard Statman Inf. Comput. 77(2): 131-137 (1988)

Coauthor Index

1	Hendrik Pieter Barendregt (Henk Barendregt)	[2] [4] [5]
2	Martin W. Bunder	[2] [4] [5] [6] [7] [8]

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page