Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Hendrik Pieter Barendregt
Henk Barendregt
2010 – today
- 2012
[c13]Sylvain Salvati, Giulio Manzonetto, Mai Gehrke, Henk Barendregt: Loader and Urzyczyn Are Logically Related. ICALP (2) 2012: 364-376- 2011
- [c12]Cezary Kaliszyk, Henk Barendregt: Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theorem. CPP 2011: 87-102
2000 – 2009
- 2009
- [j25]Henk Barendregt, Jan Willem Klop: Applications of infinitary lambda calculus. Inf. Comput. 207(5): 559-582 (2009)
- 2008
- [j24]Henk Barendregt: Towards the range property for the lambda theory H. Theor. Comput. Sci. 398(1-3): 12-15 (2008)
- [p4]Henk Barendregt: Proofs of Correctness in Mathematics and Industry. Wiley Encyclopedia of Computer Science and Engineering 2008
- 2007
- [c11]
- 2006
- [c10]
- 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
- [j23]
- [j22]Henk Barendregt, Erik Barendsen: Autarkic Computations in Formal Proofs. J. Autom. Reasoning 28(3): 321-336 (2002)
- 2001
- [j21]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)
- [p3]Henk Barendregt, Herman Geuvers: Proof-Assistants Using Dependent Type Systems. Handbook of Automated Reasoning 2001: 1149-1238
- [c8]
- 2000
- [j20]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
- [j19]Richard Statman, Henk Barendregt: Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms. J. Funct. Program. 9(5): 565-575 (1999)
- 1998
- [j18]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)
- [j17]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
- [j16]Henk Barendregt: The impact of the lambda calculus in logic and computer science. Bulletin of Symbolic Logic 3(2): 181-215 (1997)
- 1995
- [j15]Henk Barendregt: Enumerators of lambda Terms are Reducing Constructively. Ann. Pure Appl. Logic 73(1): 3-9 (1995)
- [j14]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 (Eds.): 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
- 1993
- [j13]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)
- [j12]Henk Barendregt: Constructive Proofs of the Range Property in lambda-Calculus. Theor. Comput. Sci. 121(1&2): 59-69 (1993)
- 1992
- [j11]
- [j10]Henk Barendregt: Representing `undefined' in lambda Calculus. J. Funct. Program. 2(3): 367-374 (1992)
- 1991
- [j9]
- [j8]
- 1990
- [p2]Hendrik Pieter Barendregt: Functional Programming and Lambda Calculus. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 321-363
- [c5]
1980 – 1989
- 1989
- [j7]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 Computing 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
- [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
- 1983
- [j5]Henk Barendregt, Adrian Rezus: Semantics for Classical AUTOMATH and Related Systems. Information and 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 22:18 CET by the dblp team