21 found
Order:
Disambiguations
Henk Barendregt [20]Henk P. Barendregt [1]
  1.  14
    A Filter Lambda Model and the Completeness of Type Assignment.Henk Barendregt, Mario Coppo & Mariangiola Dezani-Ciancaglini - 1983 - Journal of Symbolic Logic 48 (4):931-940.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   12 citations  
  2. A Characterization of Terms of the |Lambda I-Calculus Having a Normal Form.Henk Barendregt - 1973 - Journal of Symbolic Logic 38 (3):441 - 445.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  3. The Abidhamma Model of Consciousness and its Consequences.Henk Barendregt - forthcoming - In M.G.T. Kwee, K.J. Gergen & F. Koshikawa (eds.), Buddhist Psychology: Practice, Research & Theory. Taos Institute Publishing, Taos, New Mexico.
  4.  21
    Mindfulness Reduces Habitual Responding Based on Implicit Knowledge: Evidence From Artificial Grammar Learning.Stephen Whitmarsh, Julia Uddén, Henk Barendregt & Karl Magnus Petersson - 2013 - Consciousness and Cognition 22 (3):833-845.
    Participants were unknowingly exposed to complex regularities in a working memory task. The existence of implicit knowledge was subsequently inferred from a preference for stimuli with similar grammatical regularities. Several affective traits have been shown to influence AGL performance positively, many of which are related to a tendency for automatic responding. We therefore tested whether the mindfulness trait predicted a reduction of grammatically congruent preferences, and used emotional primes to explore the influence of affect. Mindfulness was shown to correlate negatively (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  5.  69
    The Impact of the Lambda Calculus in Logic and Computer Science.Henk Barendregt - 1997 - Bulletin of Symbolic Logic 3 (2):181-215.
    One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the representation of reasoning and the resulting systems of computer mathematics on the other hand.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  6.  16
    Pairing Without Conventional Restraints.Henk Barendregt - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (19-22):289-306.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  7.  11
    Typed Lambda Calculus.Henk P. Barendregt, Wil Dekkers & Richard Statman - 1977 - In Jon Barwise & H. Jerome Keisler (eds.), Handbook of Mathematical Logic. North-Holland Pub. Co.. pp. 1091--1132.
    Direct download  
     
    Export citation  
     
    My bibliography   4 citations  
  8.  96
    Buddhist Phenomenology.Henk Barendregt - manuscript
  9.  14
    Completeness of Two Systems of Illative Combinatory Logic for First-Order Propositional and Predicate Calculus.Wil Dekkers, Martin Bunder & Henk Barendregt - 1998 - Archive for Mathematical Logic 37 (5-6):327-341.
    Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers 4 systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators, or in a more direct way, in which derivations are not translated. Both translations (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  10.  13
    Enumerators of Lambda Terms Are Reducing Constructively.Henk Barendregt - 1995 - Annals of Pure and Applied Logic 73 (1):3-9.
    A closed λ-term E is called an enumerator if M ε /gL/dg /gTn ε N E/drn/dl = β M. Here Λ° is the set of closed λ-terms, N is the set of natural numbers and the /drn/dl are the Church numerals λfx./tfnx. Such an E is called reducing if moreover M ε /gL/dg /gTn ε N E/drn/dl /a/gb M. In 1983 I conjectured that every enumerator is reducing. An ingenious recursion theoretic proof of this conjecture by Statman is presented in (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  11.  27
    Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus.Henk Barendregt, Martin Bunder & Wil Dekkers - 1993 - Journal of Symbolic Logic 58 (3):769-788.
    Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators or, in a more direct way, in which derivations are not translated. Both translations are (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  12.  21
    Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic Into Illative Combinatory Logic.Wil Dekkers, Martin Bunder & Henk Barendregt - 1998 - Journal of Symbolic Logic 63 (3):869-890.
    Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. In a preceding paper, [2], we considered 4 systems of illative combinatory logic that are sound for first order intuitionistic propositional and predicate logic. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators, or in a more direct way, in which (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography  
  13.  1
    Pairing Without Conventional Restraints.Henk Barendregt - 1974 - Mathematical Logic Quarterly 20 (19‐22):289-306.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  14.  10
    Degrees of Sensible Lambda Theories.Henk Barendregt, Jan Bergstra, Jan Willem Klop & Henri Volken - 1978 - Journal of Symbolic Logic 43 (1):45-55.
    A λ-theory T is a consistent set of equations between λ-terms closed under derivability. The degree of T is the degree of the set of Godel numbers of its elements. H is the $\lamda$ -theory axiomatized by the set {M = N ∣ M, N unsolvable. A $\lamda$ -theory is sensible $\operatorname{iff} T \supset \mathscr{H}$ , for a motivation see [6] and [4]. In § it is proved that the theory H is ∑ 0 2 -complete. We present Wadsworth's proof (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  15.  1
    A Characterization of Terms of the λI-Calculus Having a Normal Form.Henk Barendregt - 1973 - Journal of Symbolic Logic 38 (3):441-445.
  16.  1
    Review: J. R. Hindley, B. Lercher, J. P. Seldin, Introduction to Combinatory Logic. [REVIEW]Henk Barendregt - 1973 - Journal of Symbolic Logic 38 (3):518-518.
  17. Combinatory Logic. Haskell B. Curry, J. Roger Hindley, and Jonathan P. Seldin. Combinatory Logic. Volume II. Studies in Logic and the Foundations of Mathematics, Vol. 65. North-Holland Publishing Company, Amsterdam and London 1972, XIV + 520 Pp. [REVIEW]Henk Barendregt - 1977 - Journal of Symbolic Logic 42 (1):109-110.
  18. Hindley J. R., Lercher B., and Seldin J. P.. Introduction to Combinatory Logic. London Mathematical Society Lecture Note Series, No. 7, Cambridge at the University Press, London and New York 1972, 170 Pp. [REVIEW]Henk Barendregt - 1973 - Journal of Symbolic Logic 38 (3):518.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  19. Review: Haskell B. Curry, J. Roger Hindley, Jonathan P. Seldin, Combinatory Logic. [REVIEW]Henk Barendregt - 1977 - Journal of Symbolic Logic 42 (1):109-110.
  20. Wiskunde, mystiek en natuurwetenschappen.Henk Barendregt - 2009 - Filosofie En Praktijk 30 (4):50.
    No categories
    Translate
     
     
    Export citation  
     
    My bibliography  
  21. Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic Into Illative Combinatory Logic.Wil Dekkers, Martin Bunder & Henk Barendregt - 1998 - Journal of Symbolic Logic 63 (3):869-890.
    Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants intended to capture inference. In a preceding paper, [2], we considered 4 systems of illative combinatory logic that are sound for first order intuitionistic propositional and predicate logic. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators, or in a more direct way, in which derivations are not translated. Both (...)
    Direct download  
     
    Export citation  
     
    My bibliography