Coverart for item
The Resource Combinatory logic : pure, applied and typed, Katalin Bimbó

Combinatory logic : pure, applied and typed, Katalin Bimbó

Label
Combinatory logic : pure, applied and typed
Title
Combinatory logic
Title remainder
pure, applied and typed
Statement of responsibility
Katalin Bimbó
Creator
Subject
Language
eng
Summary
Combinatory logic is one of the most versatile areas within logic that is tied to parts of philosophical, mathematical, and computational logic. Functioning as a comprehensive source for current developments of combinatory logic, this book is the only one of its kind to cover results of the last four decades. Using a reader-friendly style, the author presents the most up-to-date research studies. She includes an introduction to combinatory logic before progressing to its central theorems and proofs. The text makes intelligent and well-researched connections between combinatory logic and lambda
Member of
Cataloging source
CUS
http://library.link/vocab/creatorDate
1963-
http://library.link/vocab/creatorName
Bimbó, Katalin
Dewey number
511.3
Illustrations
illustrations
Index
index present
LC call number
QA9.5
LC item number
.B56 2012eb
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
Series statement
Discrete mathematics and its applications
http://library.link/vocab/subjectName
  • Combinatory logic
  • MATHEMATICS
  • MATHEMATICS
  • Combinatory logic
Label
Combinatory logic : pure, applied and typed, Katalin Bimbó
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Preface; Elements of combinatory logic ; Objects, combinators and terms; Various kinds of combinators; Reductions and combinatory bases; Main theorems; Church-Rosser property; Normal forms and consistency; Fixed points; Second fixed point theorem and undecidability; Recursive functions and arithmetic; Primitive and partial recursive functions; First modeling of partial recursive functions in CL; Second modeling of partial recursive functions in CL; Undecidability of weak equality; Connections to l-calculi; l-calculi: L; Combinators in L; Back and forth between CL and L; (In)equational combinatory logic; Inequational calculi; Equational calculi; Models; Term models; Operational models; Encoding functions by numbers; Domains; Models for typed CL; Relational models; Dual and symmetric combinatory logics ; Dual combinators; Symmetric combinators; Structurally free logics; Applied combinatory logic ; Illative combinatory logic; Elimination of bound variables; Typed combinatory logic; Simply typed combinatory logic; Intersection types for combinators; Appendix; Elements of combinatory logic; Main theorems; Recursive functions and arithmetic; Connections to l-calculi; (In)equational combinatory logic; Models; Dual and symmetric combinatory logic; Applied combinatory logic; Typed combinatory logic; Bibliography; List of Symbols; Index
Control code
756664691
Extent
1 online resource (xi, 345 pages)
Form of item
online
Isbn
9781439800010
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations
http://library.link/vocab/ext/overdrive/overdriveId
cl0500000324
Specific material designation
remote
System control number
(OCoLC)756664691
Label
Combinatory logic : pure, applied and typed, Katalin Bimbó
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Preface; Elements of combinatory logic ; Objects, combinators and terms; Various kinds of combinators; Reductions and combinatory bases; Main theorems; Church-Rosser property; Normal forms and consistency; Fixed points; Second fixed point theorem and undecidability; Recursive functions and arithmetic; Primitive and partial recursive functions; First modeling of partial recursive functions in CL; Second modeling of partial recursive functions in CL; Undecidability of weak equality; Connections to l-calculi; l-calculi: L; Combinators in L; Back and forth between CL and L; (In)equational combinatory logic; Inequational calculi; Equational calculi; Models; Term models; Operational models; Encoding functions by numbers; Domains; Models for typed CL; Relational models; Dual and symmetric combinatory logics ; Dual combinators; Symmetric combinators; Structurally free logics; Applied combinatory logic ; Illative combinatory logic; Elimination of bound variables; Typed combinatory logic; Simply typed combinatory logic; Intersection types for combinators; Appendix; Elements of combinatory logic; Main theorems; Recursive functions and arithmetic; Connections to l-calculi; (In)equational combinatory logic; Models; Dual and symmetric combinatory logic; Applied combinatory logic; Typed combinatory logic; Bibliography; List of Symbols; Index
Control code
756664691
Extent
1 online resource (xi, 345 pages)
Form of item
online
Isbn
9781439800010
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations
http://library.link/vocab/ext/overdrive/overdriveId
cl0500000324
Specific material designation
remote
System control number
(OCoLC)756664691

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...