+1M libros, ¡a una página de distancia!
Bookbot

Cambridge Tracts in Theoretical Computer Science Serie

Esta serie profundiza en los fundamentos teóricos de la informática, explorando las preguntas matemáticas fundamentales que rodean a las computadoras, los algoritmos y el procesamiento de datos. Ofrece una inmersión profunda en la esencia matemática de la computación y sus principios centrales. Los lectores encontrarán métodos formales para razonar sobre la corrección de programas y datos, junto con la semántica formal de los lenguajes de programación. Esta colección es esencial para cualquiera que busque comprender los cimientos matemáticos de la computación moderna.

Two-Level Functional Languages
Action Semantics
Modal Logic
Algorithmic Information Theory
Formal Semantics and Pragmatics for Natural Language Querying
Basic Simple Type Theory

Orden recomendado de lectura

  • Basic Simple Type Theory

    • 200 páginas
    • 7 horas de lectura
    3,8(9)Añadir reseña

    Focusing on a specific type system, this book offers a detailed introduction to type theory, essential for designing higher-level programming languages like ML. It explores the connection between type systems and propositional logic, while providing an in-depth examination of the type-checking algorithm foundational to these systems. The author presents the material with rigorous yet accessible mathematics, making it an ideal resource for computer scientists seeking to understand type theory at an introductory level.

    Basic Simple Type Theory

  • Formal Semantics and Pragmatics for Natural Language Querying

    • 212 páginas
    • 8 horas de lectura

    The book explores the intersection of database semantics and natural language semantics, emphasizing the importance of a coherent theory of time semantics for enhancing database models. It begins with an analysis of database querying through Montague Semantics and intensional logic. The author introduces the Historical Relational Data Model (HRDM), which incorporates a temporal dimension, and defines the database querying language QEHIII, supported by practical examples. Additionally, a formal model for interpreting questions is established, laying the groundwork for future research.

    Formal Semantics and Pragmatics for Natural Language Querying

  • Algorithmic Information Theory

    • 192 páginas
    • 7 horas de lectura
    4,0(2)Añadir reseña

    The book explores Gödel's incompleteness theorem through an innovative lens of information theory, focusing on the relationship between the complexity of computer programs and the theorem's implications. It delves into how the size and structure of these programs can provide insights into the limits of formal systems, offering a fresh perspective on foundational concepts in mathematics and computer science.

    Algorithmic Information Theory

  • Modal Logic

    • 556 páginas
    • 20 horas de lectura
    4,3(30)Añadir reseña

    This modern, advanced textbook reviews modal logic, a field which caught the attention of computer scientists in the late 1970's. The development is mathematical; prior acquaintance with first-order logic and its semantics is assumed, and familiarity with the basic mathematical notions of set theory is required. The authors focus on the use of modal languages as tools to analyze the properties of relational structures, including their algorithmic and algebraic aspects. Applications to issues in logic and computer science such as completeness, computability and complexity are considered.

    Modal Logic

  • Action Semantics

    • 396 páginas
    • 14 horas de lectura
    4,0(1)Añadir reseña

    Focusing on the formal description of programming languages, this book introduces Action Semantics, positioned between denotational and operational semantics. It emphasizes comprehensibility and accessibility while offering practical semantic descriptions of real programming languages. Dr. Peter Mosses provides a thorough introduction alongside substantial illustrations, making it a valuable resource for computer science or mathematics graduates interested in the semantics of programming languages.

    Action Semantics

  • Two-Level Functional Languages

    • 312 páginas
    • 11 horas de lectura

    The book introduces a novel framework that enhances the type notation used in functional programming languages by incorporating a specific notation to differentiate between run-time and compile-time behaviors. This extension aims to improve clarity and understanding of type systems, facilitating better programming practices and error detection in functional languages.

    Two-Level Functional Languages

  • The Uncertain Reasoner's Companion

    A Mathematical Perspective

    Reasoning under uncertainty, that is, making judgments with only partial knowledge, is a major theme in artificial intelligence. Professor Paris provides here an introduction to the mathematical foundations of the subject. The author presents the key results on the subject, and formalizes within a unified framework the main contemporary approaches and assumptions. He concentrates on giving clear mathematical formulations, analyses, justifications, and consequences of the main theories about uncertain reasoning.

    The Uncertain Reasoner's Companion
    Mostrar detalle

  • Introduction to Coalgebra

    • 494 páginas
    • 18 horas de lectura

    This book offers a clear and approachable introduction to coalgebra, emphasizing mathematical clarity through detailed explanations. It includes numerous examples and exercises designed to reinforce understanding, making it suitable for both beginners and those looking to deepen their knowledge in this area of mathematics.

    Introduction to Coalgebra