default search action
Hendrik Pieter Barendregt
Person information
- affiliation: Radboud University Nijmegen, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [b4]Henk Barendregt, Giulio Manzonetto:
A Lambda Calculus Satellite. College Publications 2022, ISBN 978-1-84890-415-6 - [j33]Henk Barendregt, Sebastiaan A. Terwijn
:
Partial combinatory algebra and generalized numberings. Theor. Comput. Sci. 925: 37-44 (2022) - [c15]Henk Barendregt, Antonino Raffone:
Axiomatizing Consciousness with Applications. A Journey from Process Algebra via Timed Automata to Model Learning 2022: 46-62 - [i5]Henk Barendregt, Antonino Raffone:
Axiomatizing consciousness, with applications. CoRR abs/2202.05700 (2022) - 2020
- [j32]Hendrik Pieter Barendregt:
Gems of Corrado Böhm. Log. Methods Comput. Sci. 16(3) (2020)
2010 – 2019
- 2019
- [j31]Henk Barendregt, Sebastiaan A. Terwijn:
Fixed point theorems for precomplete numberings. Ann. Pure Appl. Log. 170(10): 1151-1161 (2019) - [i4]Hendrik Pieter Barendregt, Sebastiaan A. Terwijn:
Partial combinatory algebra and generalized numberings. CoRR abs/1910.07750 (2019) - 2018
- [i3]Henk Barendregt, Sebastiaan A. Terwijn:
Fixed point theorems for precomplete numberings. CoRR abs/1809.06233 (2018) - [i2]Henk Barendregt:
Gems of Corrado Böhm. CoRR abs/1812.02243 (2018) - 2017
- [j30]Bram Westerbaan, Bas Westerbaan
Statman's Hierarchy Theorem. Log. Methods Comput. Sci. 13(4) (2017) - [i1]Bram Westerbaan, Bas Westerbaan, Rutger Kuyper, Carst Tankink, Remy Viehoff, Henk Barendregt:
Statman's Hierarchy Theorem. CoRR abs/1711.05497 (2017) - 2015
- [c14]Aleksy Schubert
Automata Theoretic Account of Proof Search. CSL 2015: 128-143 - 2014
- [j29]Stephen Whitmarsh
Metacognitive awareness of covert somatosensory attention corresponds to contralateral alpha power. NeuroImage 85: 803-809 (2014) - [r1]Fairouz Kamareddine, Joe B. Wells, Christoph Zengler, Henk Barendregt:
Computerising Mathematical Text. Computational Logic 2014: 343-396 - 2013
- [b3]Hendrik Pieter Barendregt, Wil Dekkers, Richard Statman:
Lambda Calculus with Types. Perspectives in logic, Cambridge University Press 2013, ISBN 978-0-521-76614-2, pp. I-XXII, 1-833 - [j28]Henk Barendregt, Venanzio Capretta, Dexter Kozen:
Reflection in the Chomsky Hierarchy. J. Autom. Lang. Comb. 18(1): 53-60 (2013) - [c13]Andrew Polonsky, Henk Barendregt:
An Ontology of States. The Beauty of Functional Code 2013: 18-26 - 2012
- [c12]Sylvain Salvati, Giulio Manzonetto, Mai Gehrke, Henk Barendregt:
Loader and Urzyczyn Are Logically Related. ICALP (2) 2012: 364-376 - 2011
- [c11]Cezary Kaliszyk
Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theorem. CPP 2011: 87-102
2000 – 2009
- 2009
- [j27]Henk Barendregt, Jan Willem Klop:
Applications of infinitary lambda calculus. Inf. Comput. 207(5): 559-582 (2009) - 2008
- [j26]Henk Barendregt:
Towards the range property for the lambda theory H. Theor. Comput. Sci. 398(1-3): 12-15 (2008) - [p5]Henk Barendregt:
Proofs of Correctness in Mathematics and Industry. Wiley Encyclopedia of Computer Science and Engineering 2008 - 2007
- [c10]Henk Barendregt:
Proving the Range Property for Lambda Theories and Models. ICTCS 2007: 4 - 2006
- [p4]Henk Barendregt:
Informal. The Seventeen Provers of the World 2006: 10 - 2005
- [c9]Richard Statman, Henk Barendregt:
Böhm's Theorem, Church's Delta, Numeral Systems, and Ershov Morphisms. Processes, Terms and Cycles 2005: 40-54 - 2002
- [j25]Henk Barendregt:
The Ancient Theory of Mind. Formal Aspects Comput. 13(3-5): 422-429 (2002) - [j24]Henk Barendregt, Erik Barendsen:
Autarkic Computations in Formal Proofs. J. Autom. Reason. 28(3): 321-336 (2002) - 2001
- [j23]Henk Barendregt, Arjeh M. Cohen:
Electronic Communication of Mathematics and the Interaction of Computer Algebra Systems and Proof Assistants. J. Symb. Comput. 32(1/2): 3-22 (2001) - [c8]Henk Barendregt:
Computing and Proving. RTA 2001: 1 - [p3]Henk Barendregt, Herman Geuvers:
Proof-Assistants Using Dependent Type Systems. Handbook of Automated Reasoning 2001: 1149-1238 - 2000
- [j22]Henk Barendregt, Silvia Ghilezan:
Lambda terms for natural deduction, sequent calculus and cut elimination. J. Funct. Program. 10(1): 121-134 (2000) - [c7]Henk Barendregt, Arjeh M. Cohen:
Representing and handling mathematical concepts by humans and machines. ISSAC 2000
1990 – 1999
- 1999
- [j21]Richard Statman, Henk Barendregt:
Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms. J. Funct. Program. 9(5): 565-575 (1999) - 1998
- [j20]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) - [j19]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) - 1997
- [j18]Henk Barendregt:
The impact of the lambda calculus in logic and computer science. Bull. Symb. Log. 3(2): 181-215 (1997) - 1995
- [j17]Henk Barendregt:
Enumerators of lambda Terms are Reducing Constructively. Ann. Pure Appl. Log. 73(1): 3-9 (1995) - [j16]Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt:
Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems. J. ACM 42(6): 1275-1304 (1995) - [c6]Gilles Barthe, Mark Ruys, Henk Barendregt:
A Two-Level Approach Towards Lean Proof-Checking. TYPES 1995: 16-35 - 1994
- [e1]Henk Barendregt, Tobias Nipkow:
Types for Proofs and Programs, International Workshop TYPES'93, Nijmegen, The Netherlands, May 24-28, 1993, Selected Papers. Lecture Notes in Computer Science 806, Springer 1994, ISBN 3-540-58085-9 [contents] - 1993
- [j15]Marcel Beemster, Pieter H. Hartel
Experience with a clustered parallel reduction machine. Future Gener. Comput. Syst. 9(3): 175-200 (1993) - [j14]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) - [j13]Henk Barendregt:
Constructive Proofs of the Range Property in lambda-Calculus. Theor. Comput. Sci. 121(1&2): 59-69 (1993) - 1992
- [j12]Henk Barendregt:
Enumerators of lambda Terms are Reducing. J. Funct. Program. 2(2): 233-236 (1992) - [j11]Henk Barendregt:
Representing 'undefined' in lambda Calculus. J. Funct. Program. 2(3): 367-374 (1992) - 1991
- [j10]Henk Barendregt:
Introduction to Generalized Type Systems. J. Funct. Program. 1(2): 125-154 (1991) - [j9]Henk Barendregt:
Self-Interpretations in lambda Calculus. J. Funct. Program. 1(2): 229-233 (1991) - 1990
- [c5]Henk Barendregt, Kees Hemerik:
Types in Lambda Calculi and Programming Languages. ESOP 1990: 1-35 - [p2]Hendrik Pieter Barendregt:
Functional Programming and Lambda Calculus. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 321-363
1980 – 1989
- 1989
- [j8]Hendrik Pieter Barendregt, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer, John R. W. Glauert, Richard Kennaway, M. Ronan Sleep:
LEAN: an intermediate language based on graph rewriting. Parallel Comput. 9(2): 163-177 (1989) - [c4]Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt:
Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-. RTA 1989: 477-491 - 1987
- [j7]Hendrik Pieter Barendregt, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer, Pieter H. Hartel
The Dutch parallel reduction machine project. Future Gener. Comput. Syst. 3(4): 261-270 (1987) - [j6]Hendrik Pieter Barendregt, Richard Kennaway, Jan Willem Klop, M. Ronan Sleep:
Needed Reduction and Spine Strategies for the Lambda Calculus. Inf. Comput. 75(3): 191-231 (1987) - [c3]Hendrik Pieter Barendregt, Marko C. J. D. van Eekelen, John R. W. Glauert, Richard Kennaway, Marinus J. Plasmeijer, M. Ronan Sleep:
Term Graph Rewriting. PARLE (2) 1987: 141-158 - [c2]Hendrik Pieter Barendregt, Marko C. J. D. van Eekelen, John R. W. Glauert, Richard Kennaway, Marinus J. Plasmeijer, M. Ronan Sleep:
Towards an Intermediate Language based on Graph Rewriting. PARLE (2) 1987: 159-175 - 1986
- [p1]Henk Barendregt, Marc van Leeuwen:
Functional Programming and the Language TALE. Current Trends in Concurrency 1986: 122-207 - 1985
- [b2]Hendrik Pieter Barendregt:
The lambda calculus - its syntax and semantics. Studies in logic and the foundations of mathematics 103, North-Holland 1985, ISBN 978-0-444-86748-3, pp. I-XV, 1-621 - 1983
- [j5]Henk Barendregt, Adrian Rezus:
Semantics for Classical AUTOMATH and Related Systems. Inf. Control. 59(1-3): 127-147 (1983) - [j4]Henk Barendregt, Mario Coppo, Mariangiola Dezani-Ciancaglini
A Filter Lambda Model and the Completeness of Type Assignment. J. Symb. Log. 48(4): 931-940 (1983)
1970 – 1979
- 1978
- [j3]Henk Barendregt, Jan A. Bergstra, Jan Willem Klop, Henri Volken:
Degrees of Sensible Lambda Theories. J. Symb. Log. 43(1): 45-55 (1978) - 1976
- [j2]Henk Barendregt:
A Global Representation of the Recursive Functions in the lambda -Calculus. Theor. Comput. Sci. 3(2): 225-242 (1976) - 1975
- [c1]Henk Barendregt:
Normed uniformly reflexive structures. Lambda-Calculus and Computer Science Theory 1975: 272-286 - 1973
- [j1]Henk Barendregt:
A Characterization of Terms of the lambda I-Calculus Having a Normal Form. J. Symb. Log. 38(3): 441-445 (1973) - 1971
- [b1]Hendrik Pieter Barendregt:
Some extensional term models for combinatory logics and l - calculi. Univ. Utrecht, 1971, pp. I-XXI, 1-140
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: