Wil Dekkers

According to our database, Wil Dekkers authored at least 10 papers between 1988 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

Automata Theoretic Account of Proof Search.

Aleksy Schubert, Wil Dekkers, Hendrik Pieter Barendregt

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2013

Lambda Calculus with Types.

Hendrik Pieter Barendregt, Wil Dekkers, Richard Statman

Perspectives in logic, Cambridge University Press, ISBN: 978-0-521-76614-2, 2013

2011

Weak mu-equality is decidable

Wil Dekkers

CoRR, 2011

2008

Are there Hilbert-style Pure Type Systems?

Martin W. Bunder, Wil Dekkers

Log. Methods Comput. Sci., 2008

2001

Pure Type Systems with More Liberal Rules.

Martin W. Bunder, Wil Dekkers

J. Symb. Log., 2001

1998

Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic into Illative Combinatory Logic.

Wil Dekkers, Martin W. Bunder, Henk Barendregt

J. Symb. Log., 1998

Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus.

Wil Dekkers, Martin W. Bunder, Henk Barendregt

Arch. Math. Log., 1998

1995

Inhabitation of Types in the Simply Typed Lambda Calculus

Wil Dekkers

Inf. Comput., May, 1995

1993

Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus.

Henk Barendregt, Martin W. Bunder, Wil Dekkers

J. Symb. Log., 1993

1988

Reducibility of Types in Typed Lambda Calculus: Comment on a Paper by Richard Statman

Wil Dekkers

Inf. Comput., May, 1988