The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Henk Barendregt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Richard Statman, Henk Barendregt
    Böhm's Theorem, Church's Delta, Numeral Systems, and Ershov Morphisms. [Citation Graph (0, 0)][DBLP]
    Processes, Terms and Cycles, 2005, pp:40-54 [Conf]
  2. Henk Barendregt, Kees Hemerik
    Types in Lambda Calculi and Programming Languages. [Citation Graph (0, 0)][DBLP]
    ESOP, 1990, pp:1-35 [Conf]
  3. Henk Barendregt, Arjeh M. Cohen
    Representing and handling mathematical concepts by humans and machines. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2000, pp:- [Conf]
  4. Henk Barendregt
    Normed uniformly reflexive structures. [Citation Graph (0, 0)][DBLP]
    Lambda-Calculus and Computer Science Theory, 1975, pp:272-286 [Conf]
  5. Henk Barendregt
    Computing and Proving. [Citation Graph (0, 0)][DBLP]
    RTA, 2001, pp:1- [Conf]
  6. Henk Barendregt
    Informal. [Citation Graph (0, 0)][DBLP]
    The Seventeen Provers of the World, 2006, pp:10- [Conf]
  7. Gilles Barthe, Mark Ruys, Henk Barendregt
    A Two-Level Approach Towards Lean Proof-Checking. [Citation Graph (0, 0)][DBLP]
    TYPES, 1995, pp:16-35 [Conf]
  8. Henk Barendregt
    Enumerators of lambda Terms are Reducing Constructively. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:73, n:1, pp:3-9 [Journal]
  9. Henk Barendregt
    The impact of the lambda calculus in logic and computer science. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 1997, v:3, n:2, pp:181-215 [Journal]
  10. Henk Barendregt
    The Ancient Theory of Mind. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2002, v:13, n:3-5, pp:422-429 [Journal]
  11. Henk Barendregt, Adrian Rezus
    Semantics for Classical AUTOMATH and Related Systems [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:59, n:1-3, pp:127-147 [Journal]
  12. Henk Barendregt, Erik Barendsen
    Autarkic Computations in Formal Proofs. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2002, v:28, n:3, pp:321-336 [Journal]
  13. Henk Barendregt
    Introduction to Generalized Type Systems. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1991, v:1, n:2, pp:125-154 [Journal]
  14. Henk Barendregt
    Self-Interpretations in lambda Calculus. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1991, v:1, n:2, pp:229-233 [Journal]
  15. Henk Barendregt
    Enumerators of lambda Terms are Reducing. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1992, v:2, n:2, pp:233-236 [Journal]
  16. Henk Barendregt
    Representing `undefined' in lambda Calculus. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1992, v:2, n:3, pp:367-374 [Journal]
  17. Henk Barendregt, Silvia Ghilezan
    Lambda terms for natural deduction, sequent calculus and cut elimination. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2000, v:10, n:1, pp:121-134 [Journal]
  18. Richard Statman, Henk Barendregt
    Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1999, v:9, n:5, pp:565-575 [Journal]
  19. Henk Barendregt, Arjeh M. Cohen
    Electronic Communication of Mathematics and the Interaction of Computer Algebra Systems and Proof Assistants. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2001, v:32, n:1/2, pp:3-22 [Journal]
  20. Henk Barendregt
    A Characterization of Terms of the lambda I-Calculus Having a Normal Form. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1973, v:38, n:3, pp:441-445 [Journal]
  21. Henk Barendregt, Martin W. Bunder, Wil Dekkers
    Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:3, pp:769-788 [Journal]
  22. Henk Barendregt, Jan A. Bergstra, Jan Willem Klop, Henri Volken
    Degrees of Sensible Lambda Theories. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1978, v:43, n:1, pp:45-55 [Journal]
  23. Henk Barendregt, Mario Coppo, Mariangiola Dezani-Ciancaglini
    A Filter Lambda Model and the Completeness of Type Assignment. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1983, v:48, n:4, pp:931-940 [Journal]
  24. Wil Dekkers, Martin W. Bunder, Henk Barendregt
    Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic into Illative Combinatory Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:3, pp:869-890 [Journal]
  25. Henk Barendregt
    A Global Representation of the Recursive Functions in the lambda -Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:3, n:2, pp:225-242 [Journal]
  26. Henk Barendregt
    Constructive Proofs of the Range Property in lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:59-69 [Journal]

  27. Proving the Range Property for Lambda Theories and Models. [Citation Graph (, )][DBLP]


  28. Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002