The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Contextual modal type theory
Abstract
The intuitionistic modal logic of necessity is based on the judgmental notion of categorical truth. In this article we investigate the consequences of relativizing these concepts to explicitly specified contexts. We obtain contextual modal logic and its type-theoretic analogue. Contextual modal type theory provides an elegant, uniform foundation for understanding metavariables and explicit substitutions. We sketch some applications in functional programming and logical frameworks.
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
Proceedings of the International Joint Conference on Artificial Intelligence 2007
Bundy, A. (2007) · International Joint Conference on Artificial Intelligence · Cited by 2,761
A framework for defining logics
Harper, R., Honsell, F., & Plotkin, G. (1993) · Journal of the ACM · doi:10.1145/138027.138060 · Cited by 990
System Description: Twelf — A Meta-Logical Framework for Deductive Systems
Pfenning, F., & Schürmann, C. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48660-7_14 · Cited by 595
Self-citationProlegomena to a theory of mechanized formal reasoning
Weyhrauch, R. W. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90015-6 · Cited by 429
Generality in artificial intelligence
McCarthy, J. (1987) · Communications of the ACM · doi:10.1145/33447.33448 · Cited by 391
Logic Programming in a Fragment of Intuitionistic Linear Logic
Hodas, J. S., & Miller, D. (1994) · Information and Computation · doi:10.1006/inco.1994.1036 · Cited by 388
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
MILLER, D. (1991) · Journal of Logic and Computation · doi:10.1093/logcom/1.4.497 · Cited by 382
The proof theory and semantics of intuitionistic modal logic
Simpson, A. K. (1994) · Cited by 353
Multilanguage hierarchical logics, or: How we can do without modal logics
Giunchiglia, F., & Serafini, L. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90037-x · Cited by 343
A judgmental reconstruction of modal logic
PFENNING, F., & DAVIES, R. (2001) · Mathematical Structures in Computer Science · doi:10.1017/s0960129501003322 · Cited by 342
Self-citationMulti-stage programming with explicit annotations
Taha, W., & Sheard, T. (1997) · Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation · doi:10.1145/258993.259019 · Cited by 342
A modal analysis of staged computation
Davies, R., & Pfenning, F. (2001) · Journal of the ACM · doi:10.1145/382780.382785 · Cited by 293
Self-citationAbadi, M., Curien, P. L., & Levy, J. J. (1990) · Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '90 · doi:10.1145/96709.96712 · Cited by 214
Smith, P. (1975) · Journal of Symbolic Logic · doi:10.2307/2271809 · Cited by 161
A Concurrent Logical Framework I: Judgments and Properties
Watkins, K., Iliano Cervesato, A., Pfenning, F., & Walker, D. (2003) · Defense Technical Information Center (DTIC) · doi:10.21236/ada418517 · Cited by 152
Self-citationIliano Cervesato, A., & Pfenning, F. (2002) · Information and Computation · doi:10.1006/inco.2001.2951 · Cited by 135
Self-citationIntensionality, extensionality, and proof irrelevance in modal type theory
Pfenning, F. (2002) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.2001.932499 · Cited by 124
Self-citationBuvač, S., Buvač, V., & Mason, I. A. (1995) · Fundamenta Informaticae · doi:10.3233/fi-1995-232345 · Cited by 120
Pfenning, F. (2000) · Information and Computation · doi:10.1006/inco.1999.2832 · Cited by 117
Self-citationA logic programming language with lambda-abstraction, function variables, and simple unification
Miller, D. (2006) · Springer eBooks · doi:10.1007/bfb0038698 · Cited by 116
Categorical and Kripke Semantics for Constructive S4 Modal Logic
Alechina, N., Mendler, M., de Paiva, V., & Ritter, E. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44802-0_21 · Cited by 106
Quantificational logic of context
Buvač, S. (1996) · Cited by 93
Magnusson, L. (1994) · Gothenburg University Publications Electronic Archive (Gothenburg University) · Cited by 88
Higher Order Unification via Explicit Substitutions
Gilles Dowek, B., Hardin, T., & Kirchner, C. (2000) · Information and Computation · doi:10.1006/inco.1999.2837 · Cited by 80
Unification via Explicit Substitutions: The Case of Higher-Order Patterns.
Gilles Dowek, B., Hardin, T., Kirchner, C., & Pfenning, F. (1996) · Cited by 69
Self-citationElementary Complexity and Geometry of Interaction
Baillot, P., & Pedicini, M. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48959-2_4 · Cited by 64
Staged computation with names and necessity
Nanevski, A., & Pfenning, F. (2005) · Journal of Functional Programming · doi:10.1017/s095679680500568x · Cited by 57
Self-citationOptimizing Higher-Order Pattern Unification
Pientka, B., & Pfenning, F. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45085-6_40 · Cited by 39
Self-citationOpen Proofs and Open Terms: A Basis for Interactive Logic
Geuvers, H., & Jojgov, G. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45793-3_36 · Cited by 34
Tabled higher-order logic programming
Pfenning, F., & Pientka, B. (2003) · Cited by 31
Self-citationFrom dynamic binding to state via modal possibility
Nanevski, A. (2003) · doi:10.1145/888251.888271 · Cited by 21
Self-citationConstruction and deduction in type theories
Strecker, M. (1999) · OPen Access Repositorium der Universität Ulm (OPARU) (Ulm University) · doi:10.18725/oparu-3 · Cited by 19
Functional programming with names and necessity
Nanevski, A., & Pfenning, F. (2004) · Cited by 16
Self-citationTradeoffs in the Intensional Representation of Lambda Terms
Liang, C. C., & Nadathur, G. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45610-4_14 · Cited by 12
Cited by
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
CARETTE, J., KISELYOV, O., & SHAN, C.-C. (2009) · Journal of Functional Programming · doi:10.1017/s0956796809007205 · Cited by 279
Coeffects: a calculus of context-dependent computation
Petricek, T., Orchard, D., & Mycroft, A. (2014) · Proceedings of the 19th ACM SIGPLAN international conference on Functional programming · doi:10.1145/2628136.2628160 · Cited by 74
Combining effects and coeffects via grading
Gaboardi, M., Katsumata, S.-Y., Orchard, D., Breuvart, F., & Uustalu, T. (2016) · Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming · doi:10.1145/2951913.2951939 · Cited by 63
Coeffects: Unified Static Analysis of Context-Dependence
Petricek, T., Orchard, D., & Mycroft, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39212-2_35 · Cited by 48
Metadata
- Authors
- Nanevski, A., Pfenning, F., & Pientka, B.
- Venue
- ACM Transactions on Computational Logic
- Published
- 2008-06
- Volume
- 9
- Issue
- 3
- Pages
- 1-49
- ISSN
- 1529-3785 (ISSN-L)
- 1557-945X
- OpenAlex
- W1990204174
- Cited by
- 258
- References
- 34
- FWCI
- 30.21
- 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.