Combinatory Logic

Pure, Applied and Typed
1. Auflage 2011
ISBN: 978-1-4398-0000-3
Verlag: Chapman and Hall/CRC

Buch, Englisch, 358 Seiten, Format (B × H): 161 mm x 240 mm, Gewicht: 702 g

Reihe: Discrete Mathematics and Its Applications

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 calculi and presents models and applications to illustrate these connections.

Zielgruppe

Academic

Autoren/Hrsg.

Bimbó, Katalin

Fachgebiete

• Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
• Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik

Inhaltsverzeichnis

PrefaceElements of combinatory logicObjects, combinators and termsVarious kinds of combinatorsReductions and combinatory basesMain theoremsChurch–Rosser propertyNormal forms and consistencyFixed pointsSecond fixed point theorem and undecidabilityRecursive functions and arithmeticPrimitive and partial recursive functionsFirst modeling of partial recursive functions in CLSecond modeling of partial recursive functions in CLUndecidability of weak equalityConnections to l-calculil-calculi: LCombinators in LBack and forth between CL and L(In)equational combinatory logicInequational calculiEquational calculiModelsTerm modelsOperational modelsEncoding functions by numbersDomainsModels for typed CLRelational modelsDual and symmetric combinatory logicsDual combinatorsSymmetric combinatorsStructurally free logicsApplied combinatory logicIllative combinatory logicElimination of bound variablesTyped combinatory logicSimply typed combinatory logicIntersection types for combinatorsAppendixElements of combinatory logicMain theoremsRecursive functions and arithmeticConnections to l-calculi(In)equational combinatory logicModelsDual and symmetric combinatory logicApplied combinatory logicTyped combinatory logicBibliographyList of SymbolsIndex

Über Autor(innen)

Katalin Bimbo is an assistant professor in the Department of Philosophy at the University of Alberta in Edmonton, Canada.