We expose some basic elements of a style of programming supported by functional languages like Haskell by relating them to a coherent set of notions and techniques from Curry’s work in combinatory logic and formal systems, and their algebraic and categorical interpretations. Our account takes the form of a commentary to a simple fragment of Haskell code attempting to isolate the conceptual sources of the linguistic abstractions involved.

In this paper, I will argue for the relevance of certain distinctive features of messaging systems, namely those in which data can be sent and received asynchronously, can be sent to multiple simultaneous recipients and is received as a “potentially infinite” flow of unpredictable events. I will describe the social technology of the stock ticker, a telegraphic device introduced at the New York Stock Exchange in the 1860s, with reference to early twentieth century philosophers of synchronous experience, simultaneous sign interpretations, (...) and flows of discrete events. Then, I will show how the ticker’s data flows developed into the 1990s-era technologies of message queues and message brokers, which distinguished themselves through their asynchronous implementation of ticker-like message feeds sent between otherwise incompatible computers and terminals. These latter systems’ characteristic “publish/subscribe” communication pattern was one in which conceptually centralized flows of messages would be “published,” and for which “subscribers” would be spontaneously notified when events of interest occurred. This paradigm—common to the so-called “message-oriented middleware” systems of the late 1990s—would re-emerge in different asynchronous distributed system contexts over the following decades, from “push media” to Twitter to the Internet of Things. (shrink)

In this paper, I will argue for the relevance of certain distinctive features of messaging systems, namely those in which data can be sent and received asynchronously, can be sent to multiple simultaneous recipients and is received as a “potentially infinite” flow of unpredictable events. I will describe the social technology of the stock ticker, a telegraphic device introduced at the New York Stock Exchange in the 1860s, with reference to early twentieth century philosophers of synchronous experience, simultaneous sign interpretations, (...) and flows of discrete events. Then, I will show how the ticker’s data flows developed into the 1990s-era technologies of message queues and message brokers, which distinguished themselves through their asynchronous implementation of ticker-like message feeds sent between otherwise incompatible computers and terminals. These latter systems’ characteristic “publish/subscribe” communication pattern was one in which conceptually centralized flows of messages would be “published,” and for which “subscribers” would be spontaneously notified when events of interest occurred. This paradigm—common to the so-called “message-oriented middleware” systems of the late 1990s—would re-emerge in different asynchronous distributed system contexts over the following decades, from “push media” to Twitter to the Internet of Things. (shrink)

In this paper, I will argue for the relevance of certain distinctive features of messaging systems, namely those in which data can be sent and received asynchronously, can be sent to multiple simultaneous recipients and is received as a “potentially infinite” flow of unpredictable events. I will describe the social technology of the stock ticker, a telegraphic device introduced at the New York Stock Exchange in the 1860s, with reference to early twentieth century philosophers of synchronous experience, simultaneous sign interpretations, (...) and flows of discrete events. Then, I will show how the ticker’s data flows developed into the 1990s-era technologies of message queues and message brokers, which distinguished themselves through their asynchronous implementation of ticker-like message feeds sent between otherwise incompatible computers and terminals. These latter systems’ characteristic “publish/subscribe” communication pattern was one in which conceptually centralized flows of messages would be “published,” and for which “subscribers” would be spontaneously notified when events of interest occurred. This paradigm—common to the so-called “message-oriented middleware” systems of the late 1990s—would re-emerge in different asynchronous distributed system contexts over the following decades, from “push media” to Twitter to the Internet of Things. (shrink)

In this paper, I will argue for the relevance of certain distinctive features of messaging systems, namely those in which data can be sent and received asynchronously, can be sent to multiple simultaneous recipients and is received as a “potentially infinite” flow of unpredictable events. I will describe the social technology of the stock ticker, a telegraphic device introduced at the New York Stock Exchange in the 1860s, with reference to early twentieth century philosophers of synchronous experience, simultaneous sign interpretations, (...) and flows of discrete events. Then, I will show how the ticker’s data flows developed into the 1990s-era technologies of message queues and message brokers, which distinguished themselves through their asynchronous implementation of ticker-like message feeds sent between otherwise incompatible computers and terminals. These latter systems’ characteristic “publish/subscribe” communication pattern was one in which conceptually centralized flows of messages would be “published,” and for which “subscribers” would be spontaneously notified when events of interest occurred. This paradigm—common to the so-called “message-oriented middleware” systems of the late 1990s—would re-emerge in different asynchronous distributed system contexts over the following decades, from “push media” to Twitter to the Internet of Things. (shrink)

A chronicled approach to the notion of computer simulations shows that there are two predominant interpretations in the specialized literature. According to the first interpretation, computer simulations are techniques for finding the set of solutions to a mathematical model. I call this first interpretation the problem-solving technique viewpoint. In its second interpretation, computer simulations are considered to describe patterns of behavior of a target system. I call this second interpretation the description of patterns of behavior viewpoint of computer simulations. This (...) article explores these two interpretations of computer simulations from three different angles. First, I collect a series of definitions of computer simulation from the historical record. I track back definitions to the early 1960s and show how each viewpoint shares similar interpretations of computer simulations—ultimately clustering into the two viewpoints aforementioned. This reconstruction also includes the most recent literature. Second, I unpack the philosophical assumptions behind each viewpoint, with a special emphasis on their differences. Third, I discuss the philosophical implications of each viewpoint in the context of the recent discussion on the logic of scientific explanation for computer simulations. (shrink)

A chronicled approach to the notion of computer simulations shows that there are two predominant interpretations in the specialized literature. According to the first interpretation, computer simulations are techniques for finding the set of solutions to a mathematical model. I call this first interpretation the problem-solving technique viewpoint. In its second interpretation, computer simulations are considered to describe patterns of behavior of a target system. I call this second interpretation the description of patterns of behavior viewpoint of computer simulations. This (...) article explores these two interpretations of computer simulations from three different angles. First, I collect a series of definitions of computer simulation from the historical record. I track back definitions to the early 1960s and show how each viewpoint shares similar interpretations of computer simulations—ultimately clustering into the two viewpoints aforementioned. This reconstruction also includes the most recent literature. Second, I unpack the philosophical assumptions behind each viewpoint, with a special emphasis on their differences. Third, I discuss the philosophical implications of each viewpoint in the context of the recent discussion on the logic of scientific explanation for computer simulations. (shrink)

Despite being one of the most dependable methods used by applied mathematicians and engineers in handling complex systems, the finite element method commits variational crimes. This paper contextualizes the concept of variational crime within a broader account of mathematical practice by explaining the tradeoff between complexity and accuracy involved in the construction of numerical methods. We articulate two standards of accuracy used to determine whether inexact solutions are good enough and show that, despite violating the justificatory principles of one, the (...) finite element method nevertheless succeeds in obtaining its legitimacy from the other. (shrink)

The present paper intends to draw the conception of language implied in the technique of word embeddings that supported the recent development of deep neural network models in computational linguistics. After a preliminary presentation of the basic functioning of elementary artificial neural networks, we introduce the motivations and capabilities of word embeddings through one of its pioneering models, word2vec. To assess the remarkable results of the latter, we inspect the nature of its underlying mechanisms, which have been characterized as the (...) implicit factorization of a word-context matrix. We then discuss the ordinary association of the “distributional hypothesis” with a “use theory of meaning,” often justifying the theoretical basis of word embeddings, and contrast them to the theory of meaning stemming from those mechanisms through the lens of matrix models. Finally, we trace back the principles of their possible consistency through Harris’s original distributionalism up to the structuralist conception of language of Saussure and Hjelmslev. Other than giving access to the technical literature and state of the art in the field of natural language processing to non-specialist readers, the paper seeks to reveal the conceptual and philosophical stakes involved in the recent application of new neural network techniques to the computational treatment of language. (shrink)

This article argues that the English-language nonsense words “foo,” “bar,” “baz,” and others in a more or less standardized sequence of so-called metasyntactic variables commonly used in computer programming ought to be understood as meta-abstractive, re-representing a linguistically derived code’s abstraction of language and the abstraction of the programming language hierarchy itself, making it legible in a manner that rewards culturally oriented study: for example, of programming as a culture and of cultures of software development or engineering.

This article argues that the English-language nonsense words “foo,” “bar,” “baz,” and others in a more or less standardized sequence of so-called metasyntactic variables commonly used in computer programming ought to be understood as meta-abstractive, re-representing a linguistically derived code’s abstraction of language and the abstraction of the programming language hierarchy itself, making it legible in a manner that rewards culturally oriented study: for example, of programming as a culture and of cultures of software development or engineering.

This article argues that the English-language nonsense words “foo,” “bar,” “baz,” and others in a more or less standardized sequence of so-called metasyntactic variables commonly used in computer programming ought to be understood as meta-abstractive, re-representing a linguistically derived code’s abstraction of language and the abstraction of the programming language hierarchy itself, making it legible in a manner that rewards culturally oriented study: for example, of programming as a culture and of cultures of software development or engineering.

This article argues that the English-language nonsense words “foo,” “bar,” “baz,” and others in a more or less standardized sequence of so-called metasyntactic variables commonly used in computer programming ought to be understood as meta-abstractive, re-representing a linguistically derived code’s abstraction of language and the abstraction of the programming language hierarchy itself, making it legible in a manner that rewards culturally oriented study: for example, of programming as a culture and of cultures of software development or engineering.

The topics of structural proof theory and logic programming have influenced each other for more than three decades. Proof theory has contributed the notion of sequent calculus, linear logic, and higher-order quantification. Logic programming has introduced new normal forms of proofs and forced the examination of logic-based approaches to the treatment of bindings. As a result, proof theory has responded by developing an approach to proof search based on focused proof systems in which introduction rules are organized into two alternating (...) phases of rule application. Since the logic programming community can generate many examples and many design goals, the close connections with proof theory have helped to keep proof theory relevant to the general topic of computational logic. (shrink)

In a society where computers have become ubiquitous, it is necessary to develop a broader understanding of the nature of computing and programming, not just from a technical viewpoint but also from a historical and philosophical perspective. Computers and computer programs do not exist in a vacuum. Instead, they are a part of a rich socio-technological context that provides ways for understanding computers and reasoning about programs. This includes not only formal logic, mathematics, sciences, and technology but also cognitive sciences (...) and sociology. The focus of this special issue is on questions that arise when we consider computing and programming in a wider context. In particular, the papers in this special issue explore the interplay between computing or programming and mathematics, formal logic, sciences, technology, and society. (shrink)