17 found
Sort by:
Disambiguations:
Henk Barendregt [15]Henk P. Barendregt [2]
  1. Henk Barendregt (forthcoming). The Abidhamma Model of Consciousness and its Consequences. In M.G.T. Kwee, K.J. Gergen & F. Koshikawa (eds.), Buddhist Psychology: Practice, Research & Theory. Taos Institute Publishing, Taos, New Mexico.
  2. Stephen Whitmarsh, Julia Uddén, Henk Barendregt & Karl Magnus Petersson (2013). Mindfulness Reduces Habitual Responding Based on Implicit Knowledge: Evidence From Artificial Grammar Learning. Consciousness and Cognition 22 (3):833-845.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  3. Stephen Whitmarsh, Ingrid L. C. Nieuwenhuis, Henk P. Barendregt & Ole Jensen (2011). Sensorimotor Alpha Activity is Modulated in Response to the Observation of Pain in Others. Frontiers in Human Neuroscience 5.
  4. Henk Barendregt (2009). Wiskunde, mystiek en natuurwetenschappen. Filosofie En Praktijk 30 (4):50.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  5. Wil Dekkers, Martin Bunder & Henk Barendregt (1998). Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic Into Illative Combinatory Logic. 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 (6 more)  
     
    My bibliography  
     
    Export citation  
  6. Wil Dekkers, Martin Bunder & Henk Barendregt (1998). Completeness of Two Systems of Illative Combinatory Logic for First-Order Propositional and Predicate Calculus. 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 (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  7. Henk Barendregt (1997). The Impact of the Lambda Calculus in Logic and Computer Science. 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)  
     
    My bibliography  
     
    Export citation  
  8. Henk Barendregt (1995). Enumerators of Lambda Terms Are Reducing Constructively. Annals of Pure and Applied Logic 73 (1):3-9.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  9. Henk Barendregt, Martin Bunder & Wil Dekkers (1993). Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus. 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 (7 more)  
     
    My bibliography  
     
    Export citation  
  10. Henk Barendregt, Buddhist Phenomenology.
  11. Henk Barendregt, Mario Coppo & Mariangiola Dezani-Ciancaglini (1983). A Filter Lambda Model and the Completeness of Type Assignment. Journal of Symbolic Logic 48 (4):931-940.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  12. Henk Barendregt, Jan Bergstra, Jan Willem Klop & Henri Volken (1978). Degrees of Sensible Lambda Theories. 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 (6 more)  
     
    My bibliography  
     
    Export citation  
  13. Henk Barendregt (1977). Review: Haskell B. Curry, J. Roger Hindley, Jonathan P. Seldin, Combinatory Logic. [REVIEW] Journal of Symbolic Logic 42 (1):109-110.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  14. Henk P. Barendregt, Wil Dekkers & Richard Statman (1977). Typed Lambda Calculus. In Jon Barwise & H. Jerome Keisler (eds.), Handbook of Mathematical Logic. North-Holland Pub. Co.. 1091--1132.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  15. Henk Barendregt (1974). Pairing Without Conventional Restraints. Mathematical Logic Quarterly 20 (19‐22):289-306.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  16. Henk Barendregt (1973). A Characterization of Terms of the |Lambda I-Calculus Having a Normal Form. Journal of Symbolic Logic 38 (3):441 - 445.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  17. Henk Barendregt (1973). Review: J. R. Hindley, B. Lercher, J. P. Seldin, Introduction to Combinatory Logic. [REVIEW] Journal of Symbolic Logic 38 (3):518-518.
    Direct download  
     
    My bibliography  
     
    Export citation