By Henk Barendregt (and colleagues)

HP Barendregt [2020]
Republication of “Some extensional term models for combinatory logics and lambda-calculi: motivation, the making of, 2020 hindsight“, Kindle Direct Publishing.

HP Barendregt [2020]
The gems of Corrado Böhm Logical methods in Computer Science, 16(3), 15:1-15:28

HP Barendregt and SA Terwijn [2019]
Fixed point theorems for precomplete numberings. Annals of Pure and Applied Logic, 170 (2019), 1151-1161.

H.P. Barendregt, J. Endrullis, J.W. Klop, J. Waldmann [2018]
Dance of the starlings
in: Raymond Smullyan on Self-reference, Eds M. Fitting and B. Rayman, Springer, 67-111.

Bram Westerbaan, Bas Westerbaan, R Kuyper, C Tankink, R Viehoff, H Barendregt [2017]
Statman’s Hierarchy Theorem, Logical Methods in Computer Science 13(4).

A. Schubert, W. Dekkers, H.P. Barendregt [2015]
Automata Theoretic Account of Proof Search, in: 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), Ed. S. Kreutzer, Leibniz International Proceedings in Informatics (LIPIcs) 41, 128-143.

F. Kamareddine, J. Wells, C. Zengler, H. Barendregt [2014]
Computerising Mathematical Text, in: D.M. Gabbay, J.H. Siekmann, J. Woods (eds.), Computational Logic, North Holland, 343-398.

H.P. Barendregt, Wil Dekkers, Richard Statman [2013]
Lambda Calculus with Types, Cambridge University Press, xxii + 833 pp.
This handbook with exercises reveals in formalisms, hitherto mostly used for software and hardware design and verification, unexpected mathematical beauty.

A. Polonsky and H. P. Barendregt [2013]
An Ontology of States,
In: The Beauty of Functional Code – Essays Dedicated to Rinus Plasmeijer on the Occasion of His 61st Birthday. Eds P. Achten and P. W. M. Koopman. Springer, LNCS 8106, 18-26.

H.P. Barendregt, V. Capretta, D. Kozen [2013]
Reflection in the Chomsky hierarchy
Journal of Automata, Languages and Combinatorics. 18 (1), 53-60.

H.P. Barendregt [2013]
Foundations of Mathematics from the Perspective of Computer Mathematics
In: Mathematics, Computer Science and Logic – A Never Ending Story, Festschrift for Bruno Buchberger. Ed. P. Paule. Springer, 1-49.

H.P. Barendregt and A. Raffone [2013]
Conscious cognition as a discrete, deterministic, and universal Turing Machine process In: Alan Turing, his work and impact. Edited by B. Cooper and J. van Leeuwen.
Elsevier, 92-97.

H.P. Barendregt, G. Manzonetto and R. Plasmeijer [2013]
The imperative and functional programming paradigm
Alan Turing, his work and impact. Edited by B. Cooper and J. van Leeuwen.
Elsevier, 121-126.

Barendregt, H.P. and G. Manzonetto [2013]
Turing’s contributions to lambda calculus
Alan Turing, his work and impact. Edited by B. Cooper and J. van Leeuwen.
Elsevier, 139-143.

S. Salvati and G. Manzonetto and M. Gehrke and H.P. Barendregt [2012]
Loader and Urzyczyn are Logically Related
Automata, Languages, and Programming – 39th International Colloquium, ICALP 2012, Springer Lecture Notes in Computer Science 7392. Eds A. Czumaj, K. Mehlhorn, A.M. Pitts, and R. Wattenhofer. pp. 364-376.

C. Kaliszyk and H.P. Barendregt [2011]
Reasoning about Constants in Nominal Isabelle, or how to Formalize the Second Fixed Point Theorem
Proc. of the First International Conference on Certified Programs and Proofs. Edited by J.-P. Jouannaud and Zhong Shao. Springer. pp. 87-102.

J.W. Klop and H.P. Barendregt 2009
Applications of infinitary lambda terms
Information and Computation, 207 (5), 559-582.

H.P. Barendregt 2009
Wiskunde, mystiek en natuurwetenschappen
Filosofie & Praktijk 30(4), 50-59.

H.P. Barendregt 2009
Proofs of correctness in Mathematics and Industry
In: B. W. Wah (ed.), Wiley Encyclopedia of Computer Science and Engineering,
Wiley, 2284-2290.

H.P. Barendregt 2008
Towards the range property for the lambda theory H,
in: S. Berardi & U. de’Liguoro (Eds.) Calculi, Types and Applications: Essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi Della Rocca, Theoretical Computer Science 398(1-3), 12-15.

H.P. Barendregt & F. Wiedijk 2006
Bewijzen: romantisch of cool?
Euclides 81(4), 175-179.

H.P. Barendregt & F. Wiedijk 2005
The Challenge of Computer Mathematics
Philosophical Transactions of the Royal Society A, 363(1835), 2351-2375.

R. Statman & H.P. Barendregt 2005
Böhm’s Theorem, Church’s Delta, Numeral Systems, and Ershov Morphisms
In: A. Middeldorp, V. van Oostrom, F. van Raamsdonk, R. de Vrijer (Eds.) Processes, terms and cycles: steps on the road to infinity: essays dedicated to Jan Willem Klop on the occasion of his 60th birthday, Springer, Berlin – New York, 40-54.

H.P. Barendregt 2003
Towards an interactive Mathematical Proof Language In: F. Kamareddine (ed.),
Thirty-five years of automating mathematics, Kluwer Academic Publishers, Dordrecht, 25-36.

H.P. Barendregt 2001
Discriminating coded lambda terms
in: A. Anderson and M. Zeleny eds., Logic, Meaning and Computation: Essays in Memory of Alonzo Church, Kluwer, 275-285.

H. P. Barendregt & S. Ghilezan 2000
Lambda terms for natural deduction, sequent calculus and cut elimination
J. Funct. Programming 10(1), 121-134.

R. Statman & H.P. Barendregt 1999
Applications of Plotkin terms: partitions and morphisms for closed terms
J. Funct. Programming 9 (5), 565–575.

Earlier papers, partly overlapping with these.