Results for 'Wolmet Barendregt'

54 found
Order:
  1.  28
    The Case of Classroom Robots: Teachers’ Deliberations on the Ethical Tensions.Sofia Serholt, Wolmet Barendregt, Asimina Vasalou, Patrícia Alves-Oliveira, Aidan Jones, Sofia Petisca & Ana Paiva - 2017 - AI and Society 32 (4):613-631.
    Robots are increasingly being studied for use in education. It is expected that robots will have the potential to facilitate children’s learning and function autonomously within real classrooms in the near future. Previous research has raised the importance of designing acceptable robots for different practices. In parallel, scholars have raised ethical concerns surrounding children interacting with robots. Drawing on a Responsible Research and Innovation perspective, our goal is to move away from research concerned with designing features that will render robots (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  2. The Lambda Calculus: Its Syntax and Semantics.Hendrik Pieter Barendregt - 1984 - Elsevier.
    The revised edition contains a new chapter which provides an elegant description of the semantics. The various classes of lambda calculus models are described in a uniform manner. Some didactical improvements have been made to this edition. An example of a simple model is given and then the general theory (of categorical models) is developed. Indications are given of those parts of the book which can be used to form a coherent course.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   71 citations  
  3.  52
    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  
     
    Bookmark   4 citations  
  4.  11
    The |Lambda-Calculus.H. P. Barendregt - 1988 - Philosophical Review 97 (1):132-137.
  5.  36
    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.
  6.  26
    Lambda Calculus with Types.H. P. Barendregt - 2013 - Cambridge University Press.
    This handbook with exercises reveals the mathematical beauty of formalisms hitherto mostly used for software and hardware design and verification.
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  7.  16
    Barendregt H. P.. The Lambda Calculus. Its Syntax and Semantics. Studies in Logic and Foundations of Mathematics, Vol. 103. North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1981, Xiv + 615 Pp. [REVIEW]E. Engeler - 1984 - Journal of Symbolic Logic 49 (1):301-303.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8.  7
    Fixed Point Theorems for Precomplete Numberings.Henk Barendregt & Sebastiaan A. Terwijn - 2019 - Annals of Pure and Applied Logic 170 (10):1151-1161.
    In the context of his theory of numberings, Ershov showed that Kleene's recursion theorem holds for any precomplete numbering. We discuss various generalizations of this result. Among other things, we show that Arslanov's completeness criterion also holds for every precomplete numbering, and we discuss the relation with Visser's ADN theorem, as well as the uniformity or nonuniformity of the various fixed point theorems. Finally, we base numberings on partial combinatory algebras and prove a generalization of Ershov's theorem in this context.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9.  92
    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 (11 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  10.  32
    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 (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  11. Typed Lambda Calculi. S. Abramsky Et AL.H. P. Barendregt - 1992 - In S. Abramsky, D. Gabbay & T. Maibaurn (eds.), Handbook of Logic in Computer Science. Oxford University Press. pp. 117--309.
     
    Export citation  
     
    Bookmark   6 citations  
  12.  27
    Pairing Without Conventional Restraints.Henk Barendregt - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (19-22):289-306.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  13.  46
    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  
     
    Bookmark   5 citations  
  14.  25
    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.
  15.  26
    Methods for the Bias Adjustment of Meta-Analyses of Published Observational Studies.Suhail A. R. Doi, Jan J. Barendregt & Adedayo A. Onitilo - 2013 - Journal of Evaluation in Clinical Practice 19 (4):653-657.
  16.  15
    Pairing Without Conventional Restraints.Henk Barendregt - 1974 - Mathematical Logic Quarterly 20 (19‐22):289-306.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  17.  7
    Book Review: Henk Barendregt, Will Dekkers, Richard Statman Et Al., Lambda Calculus With Types. [REVIEW]Adrian Rezuş - 2015 - Studia Logica 103 (6):1319-1326.
  18. A Characterization of Terms of the λI-Calculus Having a Normal Form.Henk Barendregt - 1973 - Journal of Symbolic Logic 38 (3):441-445.
  19. Genetic Explanation in Psychology.Marko Barendregt - 2003 - Journal of Mind and Behavior 24 (1):67-90.
    Attempts to explain behavior genetically face two major problems: the application of the concept of genetic coding and the theoretical possibility of decomposing behavior. This paper argues that using the notion of genetic coding is appropriate in explanations of protein synthesis but inadequate and even misleading in the context of explanations of behavior. Genes should be regarded as disparate components of mechanisms that account for behavior rather than as codes for behavioral phenotypes. Such mechanistic explanations, however, presuppose the possibility of (...)
     
    Export citation  
     
    Bookmark   2 citations  
  20. Die van Barendregt.Walther Rauschenberger - forthcoming - Schopenhauer Jahrbuch:94-94.
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark  
  21.  19
    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 (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  44
    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  
     
    Bookmark   2 citations  
  23. 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.
  24. Dirk van Dalen Festschrift.H. P. Barendregt, M. Bezem, D. van Dalen & J. W. Klop - 1993
     
    Export citation  
     
    Bookmark  
  25. On the Interpretation of Terms Without a Normal Form.H. P. Barendregt - 1971 - Utrecht, Electronisch Raekencentrum Rijksuniversiteit Utrecht (Budapestlaan 6).
     
    Export citation  
     
    Bookmark  
  26. Wiskunde, mystiek en natuurwetenschappen.Henk Barendregt - 2009 - Filosofie En Praktijk 30 (4):50.
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark  
  27.  63
    Adaptive and Genomic Explanations of Human Behaviour: Might Evolutionary Psychology Contribute to Behavioural Genomics? [REVIEW]Marko Barendregt & René Van Hezewijk - 2005 - Biology and Philosophy 20 (1):57-78.
    . Evolutionary psychology and behavioural genomics are both approaches to explain human behaviour from a genetic point of view. Nonetheless, thus far the development of these disciplines is anything but interdependent. This paper examines the question whether evolutionary psychology can contribute to behavioural genomics. Firstly, a possible inconsistency between the two approaches is reviewed, viz. that evolutionary psychology focuses on the universal human nature and disregards the genetic variation studied by behavioural genomics. Secondly, we will discuss the structure of biological (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  28.  13
    J. R. Hindley, B. Lercher, and J. P. Seldin. Introduction to Combinatory Logic. London Mathematical Society Lecture Note Series, No. 7, Cambridge at the University Press, London and New York1972, 170 Pp. [REVIEW]Henk Barendregt - 1973 - Journal of Symbolic Logic 38 (3):518.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  29. Buddhist Phenomenology.Henk Barendregt - 1987
  30.  41
    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 (8 more)  
     
    Export citation  
     
    Bookmark  
  31.  23
    A Wide-Spectrum Coordination Model of Schizophrenia.Hendrik Pieter Barendregt - 2003 - Behavioral and Brain Sciences 26 (1):84-85.
    The target article presents a model for schizophrenia extending four levels of abstraction: molecules, cells, cognition, and syndrome. An important notion in the model is that of coordination, applicable to both the level of cells and of cognition. The molecular level provides an “implementation” of the coordination at the cellular level, which in turn underlies the coordination at the cognitive level, giving rise to the clinical symptoms.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  32.  13
    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.
  33.  14
    Review: Haskell B. Curry, J. Roger Hindley, Jonathan P. Seldin, Combinatory Logic. [REVIEW]Henk Barendregt - 1977 - Journal of Symbolic Logic 42 (1):109-110.
  34. The Incompleteness Theorems.H. P. Barendregt - 1976 - Rijksuniversiteit Utrecht, Mathematisch Instituut.
     
    Export citation  
     
    Bookmark   1 citation  
  35.  8
    Review: H. P. Barendregt, The Lambda Calculus. Its Syntax and Semantics. [REVIEW]E. Engeler - 1984 - Journal of Symbolic Logic 49 (1):301-303.
  36.  6
    Adaptive and Genomic Explanations of Human Behaviour: Might Evolutionary Psychology Contribute to Behavioural Genomics?Marko Barendregt & Ren Van Hezewijk - 2005 - Biology and Philosophy 20 (1):57-78.
    .Evolutionary psychology and behavioural genomics are both approaches to explain human behaviour from a genetic point of view. Nonetheless, thus far the development of these disciplines is anything but interdependent. This paper examines the question whether evolutionary psychology can contribute to behavioural genomics. Firstly, a possible inconsistency between the two approaches is reviewed, viz. that evolutionary psychology focuses on the universal human nature and disregards the genetic variation studied by behavioural genomics. Secondly, we will discuss the structure of biological explanations. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37.  3
    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  
     
    Bookmark  
  38.  38
    Handbook of Mathematical Logic, Edited by Barwise Jon with the Cooperation of Keisler H. J., Kunen K., Moschovakis Y. N., and Troelstra A. S., Studies in Logic and the Foundations of Mathematics, Vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 , Xi + 1165 Pp.Smoryński C.. D.1. The Incompleteness Theorems. Pp. 821–865.Schwichtenberg Helmut. D.2. Proof Theory: Some Applications of Cut-Elimination. Pp. 867–895.Statman Richard. D.3. Herbrand's Theorem and Gentzen's Notion of a Direct Proof. Pp. 897–912.Feferman Solomon. D.4. Theories of Finite Type Related to Mathematical Practice. Pp. 913–971.Troelstra A. S.. D.5. Aspects of Constructive Mathematics. Pp. 973–1052.Fourman Michael P.. D.6. The Logic of Topoi. Pp. 1053–1090.Barendregt Henk P.. D.1. The Type Free Lambda Calculus. Pp. 1091–1132.Paris Jeff and Harrington Leo. D.8. A Mathematical Incompleteness in Peano Arithmetic. Pp. 1133–1142. [REVIEW]W. A. Howard - 1984 - Journal of Symbolic Logic 49 (3):980-988.
  39.  11
    Abrahamson, KA, Downey, RG and Fellows, MR.R. Banacb, H. Barendregt, J. A. Bergstra, J. V. Tucker, J. Brendle, I. Moerdijk, E. Palmgren, J. I. Seiferas, A. R. Meyer & J. Terlouw - 1995 - Annals of Pure and Applied Logic 73 (1):327.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40.  24
    Book Review. The Lambda-Calculus. H. P. Barendregt(. [REVIEW]Harold Hodes - 1988 - Philosophical Review 97 (1):132-7.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  41.  8
    Term-Space Semantics of Typed Lambda Calculus.Ryo Kashima, Naosuke Matsuda & Takao Yuyama - 2020 - Notre Dame Journal of Formal Logic 61 (4):591-600.
    Barendregt gave a sound semantics of the simple type assignment system λ → by generalizing Tait’s proof of the strong normalization theorem. In this paper, we aim to extend the semantics so that the completeness theorem holds.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  42.  2
    Advances in Natural Deduction: A Celebration of Dag Prawitz's Work.Luiz Carlos Pereira & Edward Hermann Haeusler (eds.) - 2012 - Dordrecht, Netherland: Springer.
    This collection of papers, celebrating the contributions of Swedish logician Dag Prawitz to Proof Theory, has been assembled from those presented at the Natural Deduction conference organized in Rio de Janeiro to honour his seminal research. Dag Prawitz’s work forms the basis of intuitionistic type theory and his inversion principle constitutes the foundation of most modern accounts of proof-theoretic semantics in Logic, Linguistics and Theoretical Computer Science. The range of contributions includes material on the extension of natural deduction with higher-order (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  43.  26
    The Emptiness Problem for Intersection Types.Paweł Urzyczyn - 1999 - Journal of Symbolic Logic 64 (3):1195-1215.
    We study the intersection type assignment system as defined by Barendregt, Coppo and Dezani. For the four essential variants of the system (with and without a universal type and with and without subtyping) we show that the emptiness (inhabitation) problem is recursively unsolvable. That is, there is no effective algorithm to decide if there is a closed term of a given type. It follows that provability in the logic of "strong conjunction" of Mints and Lopez-Escobar is also undecidable.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  44. Equivalences Between Pure Type Systems and Systems of Illative Combinatory Logic.M. W. Bunder & W. J. M. Dekkers - 2005 - Notre Dame Journal of Formal Logic 46 (2):181-205.
    Pure Type Systems, PTSs, were introduced as a generalization of the type systems of Barendregt's lambda cube and were designed to provide a foundation for actual proof assistants which will verify proofs. Systems of illative combinatory logic or lambda calculus, ICLs, were introduced by Curry and Church as a foundation for logic and mathematics. In an earlier paper we considered two changes to the rules of the PTSs which made these rules more like ICL rules. This led to four (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  45.  11
    Some Results on Numeral Systems in $\lambda$ -Calculus.Benedetto Intrigila - 1994 - Notre Dame Journal of Formal Logic 35 (4):523-541.
    In this paper we study numeral systems in the -calculus. With one exception, we assume that all numerals have normal form. We study the independence of the conditions of adequacy of numeral systems. We find that, to a great extent, they are mutually independent. We then consider particular examples of numeral systems, some of which display paradoxical properties. One of these systems furnishes a counterexample to a conjecture of Böhm. Next, we turn to the approach of Curry, Hindley, and Seldin. (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  46.  18
    Comparing Cubes of Typed and Type Assignment Systems.Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca & Pawel Urzyczyn - 1997 - Annals of Pure and Applied Logic 86 (3):267-303.
    We study the cube of type assignment systems, as introduced in Giannini et al. 87–126), and confront it with Barendregt's typed gl-cube . The first is obtained from the latter through applying a natural type erasing function E to derivation rules, that erases type information from terms. In particular, we address the question whether a judgement, derivable in a type assignment system, is always an erasure of a derivable judgement in a corresponding typed system; we show that this property (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  47.  40
    Modal Pure Type Systems.Tijn Borghuis - 1998 - Journal of Logic, Language and Information 7 (3):265-296.
    We present a framework for intensional reasoning in typed -calculus. In this family of calculi, called Modal Pure Type Systems (MPTSs), a propositions-as-types-interpretation can be given for normal modal logics. MPTSs are an extension of the Pure Type Systems (PTSs) of Barendregt (1992). We show that they retain the desirable meta-theoretical properties of PTSs, and briefly discuss applications in the area of knowledge representation.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  48.  7
    The Range Property Fails for H.Andrew Polonsky - 2012 - Journal of Symbolic Logic 77 (4):1195-1210.
    We work in λH, the untyped λ-calculus in which all unsolvables are identified. We resolve a conjecture of Barendregt asserting that the range of a definable map is either infinite or a singleton. This is refuted by constructing a λ-term Ξ such that ΞM = ΞΙ ⟺ ΞM ≠ ΞΩ. The construction generalizes to ranges of any finite size, and to some other sensible lambda theories.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  49.  21
    Pure Type Systems with More Liberal Rules.Martin Bunder & Wil Dekkers - 2001 - Journal of Symbolic Logic 66 (4):1561-1580.
    Pure Type Systems, PTSs, introduced as a generalisation of the type systems of Barendregt's lambda-cube, provide a foundation for actual proof assistants, aiming at the mechanic verification of formal proofs. In this paper we consider simplifications of some of the rules of PTSs. This is of independent interest for PTSs as this produces more flexible PTS-like systems, but it will also help, in a later paper, to bridge the gap between PTSs and systems of Illative Combinatory Logic. First we (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  50.  22
    A Conjecture on Numeral Systems.Karim Nour - 1997 - Notre Dame Journal of Formal Logic 38 (2):270-275.
    A numeral system is an infinite sequence of different closed normal -terms intended to code the integers in -calculus. Barendregt has shown that if we can represent, for a numeral system, the functions Successor, Predecessor, and Zero Test, then all total recursive functions can be represented. In this paper we prove the independancy of these three particular functions. We give at the end a conjecture on the number of unary functions necessary to represent all total recursive functions.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 54