Locus Solum: From the rules of logic to the logic of rules
The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085 · cited 6×
“• Proof-net These are surely the most original artifact of the paper Girard (1987a).”
BackgroundMethodInfluentialSelf-citationShoenfield, J. R. (1967) · Cited by 2,108
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (2006) · Monatshefte für Mathematik · doi:10.1007/s00605-006-0423-7 · Cited by 2,077
The Mathematics of Sentence Structure
Lambek, J. (1958) · The American Mathematical Monthly · doi:10.1080/00029890.1958.11989160 · Cited by 1,273
Call-by-name, call-by-value and the λ-calculus
Plotkin, G. D. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90017-1 · Cited by 1,154
LCF considered as a programming language
Plotkin, G. D. (1977) · Theoretical Computer Science · doi:10.1016/0304-3975(77)90044-5 · Cited by 1,083
Coquand, T., & Huet, G. (1988) · Information and Computation · doi:10.1016/0890-5401(88)90005-3 · Cited by 1,082
Abadi, M., & Cardelli, L. (1996) · Monographs in Computer Science · doi:10.1007/978-1-4419-8598-9 · Cited by 1,001
Hilbert, D. (1926) · Mathematische Annalen · doi:10.1007/bf01206605 · Cited by 776
Scott, D. (2006) · Springer eBooks · doi:10.1007/bfb0079432 · Cited by 736
On Full Abstraction for PCF: I, II, and III
Hyland, J. M. E., & Ong, C.-H. L. (2000) · Information and Computation · doi:10.1006/inco.2000.2917 · Cited by 686
Investigations into Logical Deduction
Gentzen, G. (1964) · American Philosophical Quarterly · Cited by 659
Intensional interpretations of functionals of finite type I
Tait, W. W. (1967) · Journal of Symbolic Logic · doi:10.2307/2271658 · Cited by 557
Abramsky, S., Jagadeesan, R., & Malacaria, P. (2000) · Information and Computation · doi:10.1006/inco.2000.2930 · Cited by 470
Linear Logic: its syntax and semantics
Girard, J.-Y. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511629150.002 · Cited by 451
Self-citationGames and Full Completeness for Multiplicative Linear Logic
Abramsky, S., & Jagadeesan, R. (1994) · Journal of Symbolic Logic · doi:10.2307/2275407 · Cited by 378 · cited 3×
“This sequence can be understood as the trace of the interaction between a program (Proponent) and its environment (Opponent) (Abramsky and Jagadeesan 1994; Danos et al. 1996).”
BackgroundThe system F of variable types, fifteen years later
Girard, J.-Y. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90044-7 · Cited by 357
Self-citationThe structure of multiplicatives
Danos, V., & Regnier, L. (1989) · Archive for Mathematical Logic · doi:10.1007/bf01622878 · Cited by 340
Tutorial notes on partial evaluation
Consel, C., & Danvy, O. (1993) · Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93 · doi:10.1145/158511.158707 · Cited by 316
Quantales and (noncommutative) linear logic
Yetter, D. N. (1990) · Journal of Symbolic Logic · doi:10.2307/2274953 · Cited by 313
A new constructive logic: classic logic
Girard, J.-Y. (1991) · Mathematical Structures in Computer Science · doi:10.1017/s0960129500001328 · Cited by 307
Self-citationA game semantics for linear logic
Blass, A. (1992) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(92)90073-9 · Cited by 285
Church, A., & Rosser, J. B. (1936) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1936-1501858-0 · Cited by 285
Linear objects: Logical processes with built-in inheritance
Andreoli, J., & Pareschi, R. (1991) · New Generation Computing · doi:10.1007/bf03037173 · Cited by 232
Definitional Interpreters for Higher-Order Programming Languages
Reynolds, J. C. (1998) · Higher-Order and Symbolic Computation · doi:10.1023/a:1010027404223 · Cited by 217
Syntactic control of interference
Reynolds, J. C. (1978) · Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 · doi:10.1145/512760.512766 · Cited by 200
Girard, J.-Y. (1993) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(93)90093-s · Cited by 197
Self-citationFunctional Characters of Solvable Terms
Coppo, M., Mariangiola Dezani-ciancaglini, A., & Betti Venneri, B. (1981) · Mathematical logic quarterly · doi:10.1002/malq.19810270205 · Cited by 195
*-Autonomous categories and linear logic
Barr, M. (1991) · Mathematical Structures in Computer Science · doi:10.1017/s0960129500001274 · Cited by 177
Bainbridge, E. S., Freyd, P. J., Scedrov, A., & Scott, P. J. (1990) · Theoretical Computer Science · doi:10.1016/0304-3975(90)90151-7 · Cited by 159
Hereditarily sequential functionals
Nickau, H. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58140-5_25 · Cited by 138
Forum: A multiple-conclusion specification logic
Miller, D. (1996) · Theoretical Computer Science · doi:10.1016/0304-3975(96)00045-x · Cited by 133
de Paiva, V. (1989) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/092/1003194 · Cited by 94
Iliano Cervesato, A., & Pfenning, F. (2002) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1996.561339 · Cited by 86
On phase semantics and denotational semantics: the exponentials
Bucciarelli, A., & Ehrhard, T. (2001) · Annals of Pure and Applied Logic · doi:10.1016/s0168-0072(00)00056-7 · Cited by 79
Decision problems for propositional linear logic
Lincoln, P. D., Michell, J., Scedrov, A., & Shankar, N. B. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89588 · Cited by 56
On the symmetry of sequentiality
Curien, P.-L. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58027-1_2 · Cited by 50
Correctness of multiplicative proof nets is linear
Guerrini, S. (2003) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1999.782640 · Cited by 49
Degrees of indeterminacy of games
Blass, A. R. (1972) · Fundamenta Mathematicae · doi:10.4064/fm-77-2-151-166 · Cited by 46
The undecidability of second order linear logic without exponentials
Lafont, Y. (1996) · Journal of Symbolic Logic · doi:10.2307/2275674 · Cited by 27
Hyland, J. M. E., Robinson, E. P., & Rosolini, G. (2006) · Springer eBooks · doi:10.1007/bfb0040266 · Cited by 19
Recursive Functionals and Quantifiers of Finite Types Revisited, V
Kleene, S. C. (1991) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1991-0974519-8 · Cited by 19
Pontrjagin duality and full completeness for multiplicative linear logic (without Mix)
Hamano, M. (2000) · Mathematical Structures in Computer Science · doi:10.1017/s0960129599003072 · Cited by 8
Metadata
- Authors
- GIRARD, J.-Y.
- Venue
- Mathematical Structures in Computer Science
- Publisher
- Cambridge University Press (CUP)
- Published
- 2001-06
- Volume
- 11
- Issue
- 3
- Pages
- 301-506
- ISSN
- 0960-1295 (ISSN-L)
- 1469-8072
- OpenAlex
- W2145617779
- Cited by
- 267
- References
- 43
- FWCI
- 10.14
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.