Skip to main content Accessibility help
×
  1. Home
  2. Browse subjects
  3. Computer Science
  4. Programming Languages and Applied Logic
  5. Content listing

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

5913 results in Programming Languages and Applied Logic

Page 1 of 296

Games on Graphs
  • From Logic and Automata to Algorithms
  • Edited by ‪Nathanaël Fijalkow
  • Coming soon
  • Expected online publication date:
    April 2026
    Print publication:
    30 April 2026
  • This volume introduces the fundamental results and the state of the art in infinite duration games on graphs. These versatile game models first appeared in the study of automata and logic, but later became important for program verification and synthesis. They have many more applications. In particular, this book covers models from the fields of optimisation, reinforcement learning, model theory, and set theory. The material is presented at a level accessible to beginning graduate students, requiring only a basic understanding of discrete algorithms and graphs. The book's primary objective is constructing efficient algorithms for analysing different types of games. Rather than describe their implementation in full detail, it investigates their theoretical foundations and proves their properties and winning strategies. This tutorial reference from experts across the field is ideal for students, researchers, and professionals in logic and automata, verification and synthesis, and related fields.

Formal Methods, Informally
  • How to Write Programs That Work
  • Carroll Morgan
  • Coming soon
  • Expected online publication date:
    February 2026
    Print publication:
    31 January 2026
  • Learn to program more effectively, faster, with better results… and enjoy both the learning experience and the benefits it ultimately brings. While this undergraduate-level textbook is motivated by formal methods, so encouraging habits that lead to correct and concise computer programs, its informal presentation sidesteps any rigid reliance on formal logic which programmers are sometimes led to believe is required. Instead, a straightforward and intuitive use of simple 'What's true here?' comments encourages precision of thought without prescription of notation. Drawing on decades of the author's experience in teaching/industry, the text's careful presentation concentrates on key principles of structuring and reasoning about programs, applying them first to small, understandable algorithms. Then students can concentrate on turning those reliably into their corresponding – and correct – program source codes. The text includes over 200 exercises, for many of which full solutions are provided. A set of all solutions is available for instructors' use.

Computable Structure Theory
  • Beyond the Arithmetic
  • Antonio Montalbán
  • Coming soon
  • Expected online publication date:
    January 2026
    Print publication:
    31 January 2026
  • Computable structure theory quantifies and studies the relative complexity of mathematical structures. This text, in conjunction with the author's previous volume, represents the first full monograph on computable structure theory in two decades. It brings new results of the author together with many older results that were previously scattered across the literature and presents them all in a coherent framework. Geared towards graduate students and researchers in mathematical logic, the book enables the reader to learn all the main results and techniques in the area for application in their own research. While the previous volume focused on countable structures whose complexity can be measured within arithmetic, this second volume delves into structures beyond arithmetic, moving into the realm of the hyperarithmetic and the infinitary languages.

  • 1 - Introduction

  • Tomas Petricek, Charles University, Prague
  • Book:
    Cultures of Programming
    Published online:
    19 December 2025
    Print publication:
    08 January 2026, pp 1-32
    • Chapter
      • You have access
      • Open access
    • PDF
    • Export citation

  • 2 - Mathematisation of Programming

  • Tomas Petricek, Charles University, Prague
  • Book:
    Cultures of Programming
    Published online:
    19 December 2025
    Print publication:
    08 January 2026, pp 33-76
    • Chapter
      • You have access
      • Open access
    • PDF
    • Export citation

  • 3 - Interactive Programming

  • Tomas Petricek, Charles University, Prague
  • Book:
    Cultures of Programming
    Published online:
    19 December 2025
    Print publication:
    08 January 2026, pp 77-131
    • Chapter
      • You have access
      • Open access
    • PDF
    • Export citation

  • 5 - Programming with Types

  • Tomas Petricek, Charles University, Prague
  • Book:
    Cultures of Programming
    Published online:
    19 December 2025
    Print publication:
    08 January 2026, pp 191-235
    • Chapter
      • You have access
      • Open access
    • PDF
    • Export citation

  • Preface

  • Tomas Petricek, Charles University, Prague
  • Book:
    Cultures of Programming
    Published online:
    19 December 2025
    Print publication:
    08 January 2026, pp ix-xi
    • Chapter
      • You have access
      • Open access
    • PDF
    • Export citation

  • Acknowledgements

  • Tomas Petricek, Charles University, Prague
  • Book:
    Cultures of Programming
    Published online:
    19 December 2025
    Print publication:
    08 January 2026, pp xii-xiv
    • Chapter
      • You have access
      • Open access
    • PDF
    • Export citation

  • 6 - Object-Oriented Programming

  • Tomas Petricek, Charles University, Prague
  • Book:
    Cultures of Programming
    Published online:
    19 December 2025
    Print publication:
    08 January 2026, pp 236-284
    • Chapter
      • You have access
      • Open access
    • PDF
    • Export citation

  • 7 - Conclusion: Cultures of Programming

  • Tomas Petricek, Charles University, Prague
  • Book:
    Cultures of Programming
    Published online:
    19 December 2025
    Print publication:
    08 January 2026, pp 285-308
    • Chapter
      • You have access
      • Open access
    • PDF
    • Export citation

  • Frontmatter

  • Tomas Petricek, Charles University, Prague
  • Book:
    Cultures of Programming
    Published online:
    19 December 2025
    Print publication:
    08 January 2026, pp i-iv
    • Chapter
      • You have access
      • Open access
    • PDF
    • Export citation

  • 4 - Software Engineering

  • Tomas Petricek, Charles University, Prague
  • Book:
    Cultures of Programming
    Published online:
    19 December 2025
    Print publication:
    08 January 2026, pp 132-190
    • Chapter
      • You have access
      • Open access
    • PDF
    • Export citation

  • Contents

  • Tomas Petricek, Charles University, Prague
  • Book:
    Cultures of Programming
    Published online:
    19 December 2025
    Print publication:
    08 January 2026, pp v-viii
    • Chapter
      • You have access
      • Open access
    • PDF
    • Export citation

  • Index

  • Tomas Petricek, Charles University, Prague
  • Book:
    Cultures of Programming
    Published online:
    19 December 2025
    Print publication:
    08 January 2026, pp 332-352
    • Chapter
      • You have access
      • Open access
    • PDF
    • Export citation

  • References

  • Tomas Petricek, Charles University, Prague
  • Book:
    Cultures of Programming
    Published online:
    19 December 2025
    Print publication:
    08 January 2026, pp 309-331
    • Chapter
      • You have access
      • Open access
    • PDF
    • Export citation

Cultures of Programming
  • The Development of Programming Concepts and Methodologies
  • Tomas Petricek
  • Published online:
    19 December 2025
    Print publication:
    08 January 2026
  • What defines a correct program? What education makes a good programmer? The answers to these questions depend on whether programs are seen as mathematical entities, engineered socio-technical systems or media for assisting human thought. Programmers have developed a wide range of concepts and methodologies to construct programs of increasing complexity. This book shows how those concepts and methodologies emerged and developed from the 1940s to the present. It follows several strands in the history of programming and interprets key historical moments as interactions between five different cultures of programming. Rooted in disciplines such as mathematics, electrical engineering, business management or psychology, the different cultures of programming have exchanged ideas and given rise to novel programming concepts and methodologies. They have also clashed about the nature of programming; those clashes remain at the core of many questions about programming today. This title is also available as Open Access on Cambridge Core.

  • 11 - Collection Analysis for Horn Clauses

  • Dale Miller, INRIA Saclay-Île-de-France
  • Book:
    Proof Theory and Logic Programming
    Published online:
    01 December 2025
    Print publication:
    18 December 2025, pp 229-244

  • Summary

    This chapter explores collection analysis as a tool for proving some simple invariants about Horn clause logic programs. This static analysis of Horn clauses employs higher-order quantification and linear logic. This chapter introduces different types of collection approximations, such as multiset, set, and list approximations. The chapter also briefly mentions the automation of this analysis. Bibliographic notes provide pointers to relevant research in program analysis.

  • 6 - Linear Logic

  • Dale Miller, INRIA Saclay-Île-de-France
  • Book:
    Proof Theory and Logic Programming
    Published online:
    01 December 2025
    Print publication:
    18 December 2025, pp 107-142

  • Summary

    This chapter introduces linear logic, highlighting its unique approach to resource management. It presents sequent calculus proof systems for linear logic. The chapter discusses the polarity of logical connectives in linear logic and the concept of multi-zone sequents. It provides an informal semantics of resource consumption to illustrate the meaning of linear logic connectives. The chapter also touches upon the implementation of proof search in linear logic, mentioning techniques like lazy splitting of multisets. Bibliographic notes guide the reader to key literature on linear logic and its proof theory.

Page 1 of 296