| 2009 |
|---|
| 41 | EE | Henk Barendregt,
Jan Willem Klop:
Applications of infinitary lambda calculus.
Inf. Comput. 207(5): 559-582 (2009) |
| 2008 |
|---|
| 40 | EE | Henk Barendregt:
Proofs of Correctness in Mathematics and Industry.
Wiley Encyclopedia of Computer Science and Engineering 2008 |
| 39 | EE | Henk Barendregt:
Towards the range property for the lambda theory H.
Theor. Comput. Sci. 398(1-3): 12-15 (2008) |
| 2007 |
|---|
| 38 | | Henk Barendregt:
Proving the Range Property for Lambda Theories and Models.
ICTCS 2007: 4 |
| 2006 |
|---|
| 37 | EE | Henk Barendregt:
Informal.
The Seventeen Provers of the World 2006: 10 |
| 2005 |
|---|
| 36 | EE | Richard Statman,
Henk Barendregt:
Böhm's Theorem, Church's Delta, Numeral Systems, and Ershov Morphisms.
Processes, Terms and Cycles 2005: 40-54 |
| 2002 |
|---|
| 35 | EE | Henk Barendregt:
The Ancient Theory of Mind.
Formal Asp. Comput. 13(3-5): 422-429 (2002) |
| 34 | | Henk Barendregt,
Erik Barendsen:
Autarkic Computations in Formal Proofs.
J. Autom. Reasoning 28(3): 321-336 (2002) |
| 2001 |
|---|
| 33 | EE | Henk Barendregt:
Computing and Proving.
RTA 2001: 1 |
| 32 | | Henk Barendregt,
Herman Geuvers:
Proof-Assistants Using Dependent Type Systems.
Handbook of Automated Reasoning 2001: 1149-1238 |
| 31 | | 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) |
| 2000 |
|---|
| 30 | EE | Henk Barendregt,
Arjeh M. Cohen:
Representing and handling mathematical concepts by humans and machines.
ISSAC 2000 |
| 29 | | Henk Barendregt,
Silvia Ghilezan:
Lambda terms for natural deduction, sequent calculus and cut elimination.
J. Funct. Program. 10(1): 121-134 (2000) |
| 1999 |
|---|
| 28 | | Richard Statman,
Henk Barendregt:
Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms.
J. Funct. Program. 9(5): 565-575 (1999) |
| 1998 |
|---|
| 27 | EE | 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) |
| 26 | | 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 |
|---|
| 25 | EE | Henk Barendregt:
The impact of the lambda calculus in logic and computer science.
Bulletin of Symbolic Logic 3(2): 181-215 (1997) |
| 1995 |
|---|
| 24 | EE | Gilles Barthe,
Mark Ruys,
Henk Barendregt:
A Two-Level Approach Towards Lean Proof-Checking.
TYPES 1995: 16-35 |
| 23 | | Henk Barendregt:
Enumerators of lambda Terms are Reducing Constructively.
Ann. Pure Appl. Logic 73(1): 3-9 (1995) |
| 22 | EE | 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) |
| 1994 |
|---|
| 21 | | Henk Barendregt,
Tobias Nipkow:
Types for Proofs and Programs, International Workshop TYPES'93, Nijmegen, The Netherlands, May 24-28, 1993, Selected Papers
Springer 1994 |
| 1993 |
|---|
| 20 | | 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) |
| 19 | | Henk Barendregt:
Constructive Proofs of the Range Property in lambda-Calculus.
Theor. Comput. Sci. 121(1&2): 59-69 (1993) |
| 1992 |
|---|
| 18 | | Henk Barendregt:
Enumerators of lambda Terms are Reducing.
J. Funct. Program. 2(2): 233-236 (1992) |
| 17 | | Henk Barendregt:
Representing `undefined' in lambda Calculus.
J. Funct. Program. 2(3): 367-374 (1992) |
| 1991 |
|---|
| 16 | | Henk Barendregt:
Introduction to Generalized Type Systems.
J. Funct. Program. 1(2): 125-154 (1991) |
| 15 | | Henk Barendregt:
Self-Interpretations in lambda Calculus.
J. Funct. Program. 1(2): 229-233 (1991) |
| 1990 |
|---|
| 14 | | Henk Barendregt,
Kees Hemerik:
Types in Lambda Calculi and Programming Languages.
ESOP 1990: 1-35 |
| 13 | | Hendrik Pieter Barendregt:
Functional Programming and Lambda Calculus.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 321-363 |
| 1989 |
|---|
| 12 | | 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 |
| 11 | | 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) |
| 1987 |
|---|
| 10 | | 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 |
| 9 | | 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 |
| 8 | | 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) |
| 1986 |
|---|
| 7 | | Henk Barendregt,
Marc van Leeuwen:
Functional Programming and the Language TALE.
Current Trends in Concurrency 1986: 122-207 |
| 1983 |
|---|
| 6 | | Henk Barendregt,
Adrian Rezus:
Semantics for Classical AUTOMATH and Related Systems
Information and Control 59(1-3): 127-147 (1983) |
| 5 | | 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) |
| 1978 |
|---|
| 4 | | Henk Barendregt,
Jan A. Bergstra,
Jan Willem Klop,
Henri Volken:
Degrees of Sensible Lambda Theories.
J. Symb. Log. 43(1): 45-55 (1978) |
| 1976 |
|---|
| 3 | | Henk Barendregt:
A Global Representation of the Recursive Functions in the lambda -Calculus.
Theor. Comput. Sci. 3(2): 225-242 (1976) |
| 1975 |
|---|
| 2 | | Henk Barendregt:
Normed uniformly reflexive structures.
Lambda-Calculus and Computer Science Theory 1975: 272-286 |
| 1973 |
|---|
| 1 | | Henk Barendregt:
A Characterization of Terms of the lambda I-Calculus Having a Normal Form.
J. Symb. Log. 38(3): 441-445 (1973) |
