WorldCat Identities

Barendregt, H. P. (Hendrik Pieter)

Overview
Works: 60 works in 170 publications in 3 languages and 1,614 library holdings
Genres: Conference proceedings 
Roles: Author, Editor, Recipient, Correspondent
Classifications: QA9.5, 511.3
Publication Timeline
.
Most widely held works by H. P Barendregt
The lambda calculus : its syntax and semantics by H. P Barendregt( Book )
56 editions published between 1981 and 2012 in English and Undetermined and held by 819 WorldCat member libraries worldwide
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
Types for proofs and programs : international workshop TYPES '93, Nijmegen, the Netherlands, May 24-28, 1993 : selected papers by H. P Barendregt( Book )
14 editions published in 1994 in English and held by 342 WorldCat member libraries worldwide
"This volume contains thoroughly refereed and revised full papers selected from the presentations at the first workshop held under the auspices of the ESPRIT Basic Research Action 6453 Types for Proofs and Programs in Nijmegen, The Netherlands, in May 1993. As the whole ESPRIT BRA 6453, this volume is devoted to the theoretical foundations, design and applications of systems for theory development. Such systems help in designing mathematical axiomatisation, performing computer-aided logical reasoning, and managing databases of mathematical facts; they are also known as proof assistants or proof checkers."--Publisher's Website
Lambda calculus with types by H. P Barendregt( )
16 editions published between 2011 and 2013 in English and held by 241 WorldCat member libraries worldwide
"This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs. In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. It is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types."--Publisher's website
The incompleteness theorems by H. P Barendregt( Book )
3 editions published in 1976 in English and held by 36 WorldCat member libraries worldwide
Types for proofs and programs : selected papers ( Book )
2 editions published in 1994 in English and held by 21 WorldCat member libraries worldwide
Some extensional term models for combinatory logics and [lambda]-calculi by H. P Barendregt( Book )
7 editions published between 1971 and 2006 in English and held by 20 WorldCat member libraries worldwide
Needed reduction and spine strategies for the lambda calculus by H. P Barendregt( Book )
4 editions published in 1986 in English and Undetermined and held by 12 WorldCat member libraries worldwide
Grondslagen van de informatica by H. P Barendregt( Book )
3 editions published in 1987 in Dutch and held by 11 WorldCat member libraries worldwide
Dirk van Dalen : Festschrift ( Book )
2 editions published in 1993 in English and held by 11 WorldCat member libraries worldwide
Termination for direct sums of left-linear complete term rewriting systems by Y Toyama( Book )
4 editions published in 1989 in English and held by 11 WorldCat member libraries worldwide
Abstract: "A Term Rewriting System is called complete if it is confluent and terminating. We prove that completeness of TRSs is a 'modular' property (meaning that it stays preserved under direct sums), provided the constituent TRSs are left-linear. Here the direct sum [formula] is the union of TRSs R[subscript 0], R[subscript 1] with disjoint signature. The proof hinges crucially upon the (non)deterministic collapsing behaviour of terms from the sum TRS."
Boeren & burgers ( Book )
1 edition published in 1938 in Dutch and held by 11 WorldCat member libraries worldwide
Computable processes by H. P Barendregt( Book )
5 editions published in 1994 in English and Undetermined and held by 10 WorldCat member libraries worldwide
Abstract: "The notions of a (digital synchronous) computable process and the corresponding process control machine are introduced. These concepts are generalizations of the notions of computable function and, say, register machine. Emphasis is put on the difference between the specification, the design, the behaviour, and the realization of computable processes."
Lambda-isčislenie : ego sintaksis i semantika by H. P Barendregt( Book )
4 editions published in 1985 in Russian and held by 7 WorldCat member libraries worldwide
Handboek Wabo : herziene druk by H. P Barendregt( Book )
in Dutch and held by 6 WorldCat member libraries worldwide
Recursion theoretic operators and morphisms on numbered sets by H. P Barendregt( Book )
1 edition published in 1981 in English and held by 5 WorldCat member libraries worldwide
Types for proofs and programs : international workshop TYPES '93, Nijmegen, The Netherlands, May 1993 : selected papers by Hendrik Pieter Barendregt( Book )
1 edition published in 1994 in English and held by 4 WorldCat member libraries worldwide
Some extensional term models for combinatory logics labda - calculi by H. P Barendregt( Book )
1 edition published in 1971 in English and held by 4 WorldCat member libraries worldwide
De Dimorphie van het Ifs en de Alcoholhydrantkwestie by H. P Barendregt( Book )
1 edition published in 1896 in Dutch and held by 4 WorldCat member libraries worldwide
Term graph rewriting by H. P Barendregt( Book )
2 editions published in 1987 in English and held by 3 WorldCat member libraries worldwide
Combinatory logic and the omega-rule by H. P Barendregt( Book )
2 editions published in 1973 in English and held by 3 WorldCat member libraries worldwide
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.76 (from 0.26 for Boeren & b ... to 0.96 for The incomp ...)
Alternative Names
Barendregt, Ch.
Barendregt, H.
Barendregt, H. P.
Barendregt, H.P. 1947-
Barendregt, Hendrik P.
Barendregt, Hendrik Pieter.
Barendregt, Hendrik Pieter 1947-
Barendregt Henk
Barendregt, Henk 1947-
Barendregt, Henk P.
Barendregt, Henk P. 1947-
Languages
English (114)
Dutch (6)
Russian (4)
Covers