Locus Solum: From the rules of logic to the logic of rules

  title={Locus Solum: From the rules of logic to the logic of rules},
  author={Jean-Yves Girard},
  journal={Mathematical Structures in Computer Science},
  pages={301 - 506}
  • J. Girard
  • Published 1 June 2001
  • History
  • Mathematical Structures in Computer Science
Go back to An-fang, the Peace Square at An-Fang, the Beginning Place at An-Fang, where all things start (…) An-Fang was near a city, the only living city with a pre-atomic name (…) The headquarters of the People Programmer was at An-Fang, and there the mistake happened: A ruby trembled. Two tourmaline nets failed to rectify the laser beam. A diamond noted the error. Both the error and the correction went into the general computer. Cordwainer SmithThe Dead Lady of Clown Town, 1964. 

From axiomatic systems to the Dogmatic gene and beyond

Playful, streamlike computation

We offer a short tour into the interactive interpretation of sequential programs. We emphasize streamlike computation — that is, computation of successive bits of information upon request. The core

A gentle introduction to Girard's Transcendental Syntax for the linear logician

By using an idea of “interactive typing” reminiscent of realisability theory, it is possible to reach a semantic-free space where correctness criteria are seen as tests (as in unit testing or model checking) certifying logical correctness, thus allowing an e-ective use of logical entities.

Doing Justice to the Imitation Game

My claim in this article is that the 1950 paper in which Turing describes the world-famous set-up of the Imitation Game is much richer and intriguing than the formalist ersatz coined in the early

The Frame Problem and the Semantics of Classical Proofs

  • G. White
  • Philosophy, Computer Science
  • 2012
It is shown that real-world data can be captured using the semantics of classical proofs developed by Bellin, Hyland and Robinson, and, consequently, that the appropriate arena for solutions of the frame problem lies in proof theory.

The Blind Spot: Lectures on Logic

These lectures on logic, more specifically proof theory, are basically intended for postgraduate students and researchers in logic. The question at stake is the nature of mathematical knowledge and

Polarity and the Logic of Delimited Continuations

  • N. Zeilberger
  • Philosophy
    2010 25th Annual IEEE Symposium on Logic in Computer Science
  • 2010
This work offers a simple account of delimited control, through a natural generalization of the classical notion of polarity, which amounts to breaking the perfect symmetry between positive and negative polarity in the following way: answer types are positive.

Towards an Understanding of Girard's Transcendental Syntax: Syntax by Testing

Through his work in ludics and Geometry of Interaction, Jean-Yves Girard invites us to a change of paradigm in the study of logic : the quest for a transcendental syntax, some kind of idealized

Rule-Following and the Limits of Formalization: Wittgenstein’s Considerations Through the Lens of Logic

In the Tractatus, it is stated that questions about logical formatting (“why just these rules?”) cannot be meaningfully formulated, since it is precisely the application of logical rules which



A new constructive logic: classic logic

  • J. Girard
  • Computer Science, Philosophy
    Mathematical Structures in Computer Science
  • 1991
This work follows the order of discovery of the concepts, which (as expected) starts with the semantics and ends with the syntex; it is hoped that this orthogonal look at the same object will help to apprehend the concepts.

Linear logic: its syntax and semantics

The first objection to that view is that there are in mathematics, in real life, cases where reaction does not exist or can be neglected : think of a lemma which is forever true, or of a Mr. Soros, who has almost an infinite amount of dollars.

Geometry of interaction III: accommodating the additives

The paper expounds geometry of interaction, for the first time in the full case, i.e. for all connectives of linear logic, including additives and constants, as well as a slight modification of familiar sequent calculus in the case of exponential-free conclusions.


The paper is mainly concerned with the extension of proof-nets to additives, for which the best known solution is presented, which is shown to be compatible with quantifiers, and the structural rules of exponentials are also accommodated.

A Theory of Objects

This book takes a novel approach to the understanding of object-oriented languages by introducing object calculi and developing a theory of objects around them, which covers both the semantics of objects and their typing rules.

A Game Semantics for Linear Logic

  • A. Blass
  • Philosophy
    Ann. Pure Appl. Log.
  • 1992

The Mathematics of Sentence Structure

An effective rule (or algorithm) for distinguishing sentences from nonsentences is obtained, which works not only for the formal languages of interest to the mathematical logician, but also for natural languages such as English, or at least for fragments of such languages.

Light affine logic

  • A. Asperti
  • Computer Science
    Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)
  • 1998
This paper introduces a slight variation of LLL, by adding full weakening, which is called light affine logic, and reduces the logical system from 21 to just 11 rules, and with simpler, traditional sequents.