The DOI matches its Crossref record; 156 of the 156 references it cites were found in a registry or an index.
Advanced Topics in Types and Programming Languages
Abstract
A thorough and accessible introduction to a range of key ideas in type systems for programming language. The study of type systems for programming languages now touches many areas of computer science, from language design and implementation to software engineering, network security, databases, and analysis of concurrent and distributed systems. This book offers accessible introductions to key ideas in the field, with contributions by experts on each topic. The topics covered include precise type analyses, which extend simple type systems to give them a better grip on the run time behavior of systems; type systems for low-level languages; applications of types to reasoning about computer programs; type theory as a framework for the design of sophisticated module systems; and advanced techniques in ML-style type inference. Advanced Topics in Types and Programming Languages builds on Benjamin Pierce's Types and Programming Languages (MIT Press, 2002); most of the chapters should be accessible to readers familiar with basic notations and techniques of operational semantics and type systems—the material covered in the first half of the earlier book. Advanced Topics in Types and Programming Languages can be used in the classroom and as a resource for professionals. Most chapters include exercises, ranging in difficulty from quick comprehension checks to challenging extensions, many with solutions.
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
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,453
On the criteria to be used in decomposing systems into modules
Parnas, D. L. (1972) · Communications of the ACM · doi:10.1145/361598.361623 · Cited by 4,704
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
Milner, R., Harper, R., MacQueen, D., & Tofte, M. (1997) · The MIT Press eBooks · doi:10.7551/mitpress/2319.001.0001 · Cited by 2,419
Types and Programming Languages
Pierce, B. C. (2002) · Cited by 2,226
A theory of type polymorphism in programming
Milner, R. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90014-4 · Cited by 2,205
Java Virtual Machine Specification
Lindholm, T., & Yellin, F. (1996) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,155
Necula, G. C. (1997) · Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97 · doi:10.1145/263699.263712 · Cited by 1,843
Martin-Löf, P. (1984) · Bibliopolis eBooks · Cited by 1,590
Efficiency of a Good But Not Linear Set Union Algorithm
Tarjan, R. E. (1975) · Journal of the ACM · doi:10.1145/321879.321884 · Cited by 1,403
Schneider, F. B. (2000) · ACM Transactions on Information and System Security · doi:10.1145/353323.353382 · Cited by 1,289
Implementing Mathematics with The Nuprl Proof Development System
Constable, R. L., Allen, S. F., Bromley, H. M., Cleaveland, W. R., Cremer, J. F., Harper, R. W., Howe, D. J., Knoblock, T. B., Mendler, N. P., Panangaden, P., et al. (1986) · Cited by 1,279
The Mathematics of Sentence Structure
Lambek, J. (1958) · The American Mathematical Monthly · doi:10.1080/00029890.1958.11989160 · Cited by 1,273
Efficient software-based fault isolation
Wahbe, R., Lucco, S., Anderson, T. E., & Graham, S. L. (1993) · Proceedings of the fourteenth ACM symposium on Operating systems principles - SOSP '93 · doi:10.1145/168619.168635 · Cited by 1,214
The calculi of lambda-conversion
Rosser, B. (1941) · Medical Entomology and Zoology · Cited by 1,168
Steele, G. L. (1984) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,162
A Syntactic Approach to Type Soundness
Wright, A. K., & Felleisen, M. (1994) · Information and Computation · doi:10.1006/inco.1994.1093 · Cited by 1,136
Principal type-schemes for functional programs
Damas, L., & Milner, R. (1982) · Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '82 · doi:10.1145/582153.582176 · Cited by 1,097
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
Barendregt, H. P., Dekkers, W., & Statman, R. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9781139032636 · Cited by 1,041
A framework for defining logics
Harper, R., Honsell, F., & Plotkin, G. (1993) · Journal of the ACM · doi:10.1145/138027.138060 · Cited by 990
The Definition of Standard ML (Revised)
Milner, R., Harper, R. W., MacQueen, D. B., & Tofte, M. (1997) · Cited by 985
The Coq Proof Assistant - Reference Manual Version 6.1
Filliâtre, J.-C., Herbelin, H., Barras, B., Boutin, S., Giménez, E., Huet, G., Munoz, C. A., Cornes, C., Cornes, C., Courant, J., et al. (1997) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 979
Wadler, P. L. (1989) · International Conference on Functional Programming Languages and Computer Architecture (FPCA) · doi:10.1145/99370.99404 · Cited by 923
Wirth, N. (1988) · Springer eBooks · doi:10.1007/978-3-642-83565-0 · Cited by 896
Jim, T., Morrisett, J. G., Grossman, D., Hicks, M., Cheney, J., & Wang, Y.-L. (2002) · USENIX Annual Technical Conference · Cited by 866
Computational lambda-calculus and monads
Moggi, E. (2003) · [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science · doi:10.1109/lics.1989.39155 · Cited by 842
Towards a theory of type structure
Reynolds, J. C. (1974) · Lecture Notes in Computer Science · doi:10.1007/3-540-06859-7_148 · Cited by 815
An Efficient Unification Algorithm
Martelli, A., & Montanari, U. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357162.357169 · Cited by 776
Types, Abstraction and Parametric Polymorphism.
Reynolds, J. (1983) · IFIP Congress · Cited by 754
Jensen, K., & Wirth, N. (1975) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-37500-5 · Cited by 671
Region-Based Memory Management
Tofte, M., & Talpin, J.-P. (1997) · Information and Computation · doi:10.1006/inco.1996.2613 · Cited by 615
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319345 · Cited by 584
The Logic of Bunched Implications
O’Hearn, P. W., & Pym, D. J. (1999) · Bulletin of Symbolic Logic · doi:10.2307/421090 · Cited by 579
Dependent types in practical programming
Xi, H., & Pfenning, F. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292560 · Cited by 575
Intensional interpretations of functionals of finite type I
Tait, W. W. (1967) · Journal of Symbolic Logic · doi:10.2307/2271658 · Cited by 557
The revised report on the syntactic theories of sequential control and state
Felleisen, M., & Hieb, R. (1992) · Theoretical Computer Science · doi:10.1016/0304-3975(92)90014-7 · Cited by 523
Safe kernel extensions without run-time checking
Necula, G. C., & Lee, P. (1996) · Proceedings of the second USENIX symposium on Operating systems design and implementation · doi:10.1145/238721.238781 · Cited by 505
BI as an assertion language for mutable data structures
Ishtiaq, S., & O'Hearn, P. W. (2011) · ACM SIGPLAN Notices · doi:10.1145/1988042.1988050 · Cited by 489
Translation validation for an optimizing compiler
Necula, G. C. (2000) · Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation · doi:10.1145/349299.349314 · Cited by 488
Lucassen, J. M., & Gifford, D. K. (1988) · Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88 · doi:10.1145/73560.73564 · Cited by 481
An Introduction to Substructural Logics
Restall, G. (2002) · Routledge eBooks · doi:10.4324/9780203016244 · Cited by 455
Abstract types have existential type
Mitchell, J. C., & Plotkin, G. D. (1988) · ACM Transactions on Programming Languages and Systems · doi:10.1145/44501.45065 · Cited by 429
Flow-sensitive type qualifiers
Foster, J. S., Terauchi, T., & Aiken, A. (2002) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/512529.512531 · Cited by 412
Region-based memory management in cyclone
Grossman, D., Morrisett, G., Jim, T., Hicks, M., Wang, Y., & Cheney, J. (2002) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/512529.512563 · Cited by 403
(1990) · Cited by 392
Girard, J.-Y. (1998) · Information and Computation · doi:10.1006/inco.1998.2700 · Cited by 385
The design and implementation of a certifying compiler
Necula, G. C., & Lee, P. (1998) · Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation · doi:10.1145/277650.277752 · Cited by 358
A judgmental reconstruction of modal logic
PFENNING, F., & DAVIES, R. (2001) · Mathematical Structures in Computer Science · doi:10.1017/s0960129501003322 · Cited by 342
MCBRIDE, C., & MCKINNA, J. (2004) · Journal of Functional Programming · doi:10.1017/s0956796803004829 · Cited by 327
TIL: a type-directed optimizing compiler for ML
Tarditi, D., Morrisett, G., Cheng, P., Stone, C., Harper, R., & Lee, P. (1996) · Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation · doi:10.1145/231379.231414 · Cited by 317
Foundational proof-carrying code
Appel, A. W. (2002) · Proceedings 16th Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.2001.932501 · Cited by 308
A type and effect system for atomicity
Flanagan, C., & Qadeer, S. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781169 · Cited by 304
A type-theoretic approach to higher-order modules with sharing
Harper, R., & Lillibridge, M. (1994) · Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94 · doi:10.1145/174675.176927 · Cited by 287
Cayenne—a language with dependent types
Augustsson, L. (1998) · Proceedings of the third ACM SIGPLAN international conference on Functional programming · doi:10.1145/289423.289451 · Cited by 286
Control flow analysis in scheme
Shivers, O. (1988) · ACM SIGPLAN Notices · doi:10.1145/960116.54007 · Cited by 282
MacQueen, D. (1984) · Proceedings of the 1984 ACM Symposium on LISP and functional programming - LFP '84 · doi:10.1145/800055.802036 · Cited by 269
Information flow inference for ML
Pottier, F., & Simonet, V. (2003) · ACM Transactions on Programming Languages and Systems · doi:10.1145/596980.596983 · Cited by 262
Manifest types, modules, and separate compilation
Leroy, X. (1994) · Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94 · doi:10.1145/174675.176926 · Cited by 257
Computation and reasoning: a type theory for computer science
(1995) · Choice Reviews Online · doi:10.5860/choice.32-5698 · Cited by 241
Unification: a multidisciplinary survey
Knight, K. (1989) · ACM Computing Surveys · doi:10.1145/62029.62030 · Cited by 232
Type inference with polymorphic recursion
Henglein, F. (1993) · ACM Transactions on Programming Languages and Systems · doi:10.1145/169701.169692 · Cited by 221
Type inference with constrained types
Odersky, M., Sulzmann, M., & Wehr, M. (1999) · Theory and Practice of Object Systems · doi:10.1002/(sici)1096-9942(199901/03)5:1<35::aid-tapo4>3.0.co;2-4 · Cited by 216
Complete Type Inference for Simple Objects
Wand, M. (1987) · Logic in Computer Science · Cited by 215
Smith, F., Walker, D., & Morrisett, G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46425-5_24 · Cited by 212
Set-based analysis of ML programs
Heintze, N. (1994) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/182409.182495 · Cited by 208
Cardelli, L., & Mitchell, J. C. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0018345 · Cited by 203
Simple imperative polymorphism
Wright, A. K. (1995) · LISP and Symbolic Computation · doi:10.1007/bf01018828 · Cited by 196
Igarashi, A., & Kobayashi, N. (2002) · ACM SIGPLAN Notices · doi:10.1145/565816.503303 · Cited by 195
Building adaptive systems using ensemble
Renesse, R. V., Birman, K., Hayden, M., Vaysburd, A., & Karr, D. (1998) · Software: Practice and Experience · doi:10.1002/(sici)1097-024x(19980725)28:9<963::aid-spe179>3.0.co;2-9 · Cited by 195
Alias Types for Recursive Data Structures
Walker, D., & Morrisett, G. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45332-6_7 · Cited by 191
The Type and Effect Discipline
Talpin, J. P., & Jouvelot, P. (1994) · Information and Computation · doi:10.1006/inco.1994.1046 · Cited by 187
Inheritance as implicit coercion
Breazu-Tannen, V., Coquand, T., Gunter, C. A., & Scedrov, A. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90055-7 · Cited by 184
A certifying compiler for Java
Colby, C., Lee, P., Necula, G. C., Blau, F., Plesko, M., & Cline, K. (2000) · Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation · doi:10.1145/349299.349315 · Cited by 183
Baader, F., & Siekmann, J. H. (1994) · Cited by 182
Operational reasoning for functions with local state
Pitts, A. M., & Stark, I. (1999) · Cited by 176
Necula, G. C., & Lee, P. (1998) · Cited by 174
Higher-order modules and the phase distinction
Harper, R. W., Mitchell, J. C., & Moggi, E. (1990) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/96709.96744 · Cited by 167
Using dependent types to express modular structure
MacQueen, D. B. (1986) · Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '86 · doi:10.1145/512644.512670 · Cited by 159
A simple applicative language: mini-ML
Clément, D., Despeyroux, T., Kahn, G., & Despeyroux, J. (1986) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/319838.319847 · Cited by 159
A semantic model of types and machine instructions for proof-carrying code
Appel, A. W., & Felty, A. P. (2000) · Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/325694.325727 · Cited by 159
Turner, D. N., Wadler, P. L., & Mossin, C. (1995) · International Conference on Functional Programming Languages and Computer Architecture (FPCA) · doi:10.1145/224164.224168 · Cited by 150
Qualified Types : Theory and Practice
Jones, M. P. (1992) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 149
Applicative functors and fully transparent higher-order modules
Leroy, X. (1995) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/199448.199476 · Cited by 149
Gay, D. E., & Aiken, A. (2001) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/378795.378815 · Cited by 148
Algebraic reconstruction of types and effects
Jouvelot, P., & Gifford, D. K. (1991) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/99583.99623 · Cited by 145
The marriage of effects and monads
Wadler, P. L., & Thiemann, P. J. (2003) · ACM Transactions on Computational Logic · doi:10.1145/601775.601776 · Cited by 143
Typability and type checking in System F are equivalent and undecidable
Wells, J. B. (1999) · Annals of Pure and Applied Logic · doi:10.1016/s0168-0072(98)00047-5 · Cited by 141
Dependently Typed Functional Programs and their Proofs
McBride, C. T. (2000) · ERA · Cited by 138
Tofte, M., & Birkedal, L. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/291891.291894 · Cited by 136
Better static memory management: improving region-based analysis of higher-order languages
Aiken, A., Fähndrich, M. A., & Levien, R. (1995) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/207110.207137 · Cited by 135
Iliano Cervesato, A., & Pfenning, F. (2002) · Information and Computation · doi:10.1006/inco.2001.2951 · Cited by 135
Lafont, Y. (1988) · Theoretical Computer Science · doi:10.1016/0304-3975(88)90074-6 · Cited by 132
The Alf proof editor and its proof engine
Magnusson, L., & Nordström, B. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58085-9_78 · Cited by 131
What are principal typings and what are they good for?
Jim, T. (1996) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/237721.237728 · Cited by 125
Typed memory management via static capabilities
Walker, D., Crary, K., & Morrisett, G. (2000) · ACM Transactions on Programming Languages and Systems · doi:10.1145/363911.363923 · Cited by 125
Proofs about a folklore let-polymorphic type inference algorithm
Lee, O., & Yi, K. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/291891.291892 · Cited by 117
A polymorphic record calculus and its compilation
Ohori, A. (1995) · ACM Transactions on Programming Languages and Systems · doi:10.1145/218570.218572 · Cited by 114
Authenticity by typing for security protocols
Gordon, A. D., & Jeffrey, A. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2001.930143 · Cited by 114
On the type structure of standard ML
Harper, R. W., & Mitchell, J. C. (1993) · ACM Transactions on Programming Languages and Systems · doi:10.1145/169701.169696 · Cited by 111
Automatic computation of data set definitions
Reynolds, J. C. (2018) · NASA STI Repository (National Aeronautics and Space Administration) · doi:10.1184/r1/6603737 · Cited by 110
Linear types and non-size-increasing polynomial time computation
Hofmann, M. O. (2003) · doi:10.1109/lics.1999.782641 · Cited by 109
Type-based analysis of uncaught exceptions
Leroy, X., & Pessaux, F. (2000) · ACM Transactions on Programming Languages and Systems · doi:10.1145/349214.349230 · Cited by 103
Stack-based typed assembly language
Morrisett, G., Crary, K., Glew, N., & Walker, D. (2002) · Journal of Functional Programming · doi:10.1017/s0956796801004178 · Cited by 101
On the complexity analysis of static analyses
McAllester, D. (2002) · Journal of the ACM · doi:10.1145/581771.581774 · Cited by 95
O’Hearn, P. W. (2003) · Journal of Functional Programming · doi:10.1017/s0956796802004495 · Cited by 94
Toward a foundational typed assembly language
Crary, K. (2003) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/604131.604149 · Cited by 93
A dependently typed assembly language
Xi, H., & Harper, R. W. (2001) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/507635.507657 · Cited by 93
Syntactic Control of Interference
Reynolds, J. C. (1997) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-4118-8_11 · Cited by 93
A generic type system for the Pi-calculus
Igarashi, A., & Kobayashi, N. (2001) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/360204.360215 · Cited by 92
Kobayashi, N. (1999) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/292540.292546 · Cited by 91
A typed operational semantics for type theory
Goguen, H. H. (1994) · ERA · Cited by 86
A Polymorphic Type System for Extensible Records and Variants
Gaster, B. R., & Jones, M. P. (1996) · Cited by 86
Typing a multi-language intermediate code
Gordon, A. D., & Syme, D. (2001) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/360204.360228 · Cited by 85
Implementing typed intermediate languages
Shao, Z., League, C., & Monnier, S. (1998) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/289423.289460 · Cited by 80
Efficient resource management for linear logic proof search
Iliano Cervesato, A., Hodas, J. S., & Pfenning, F. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(99)00173-5 · Cited by 79
Ross, D. T. (1967) · Communications of the ACM · doi:10.1145/363534.363546 · Cited by 78
Lively linear Lisp: “look ma, no garbage!”
Baker, H. G. (1992) · ACM SIGPLAN Notices · doi:10.1145/142137.142162 · Cited by 77
A syntactic approach to foundational proof-carrying code
Hamid, N. A., Shao, Z., Trifonov, V., Monnier, S., & Ni, Z. (2003) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.2002.1029819 · Cited by 75
Harper, R. W., & Pollack, R. (1991) · Theoretical Computer Science · doi:10.1016/0304-3975(90)90108-t · Cited by 70
A direct approach to control-flow sensitive region-based memory management
Henglein, F., Makholm, H., & Niss, H. (2001) · International Symposium on Principles and Practice of Declarative Programming (PPDP) · doi:10.1145/773184.773203 · Cited by 67
Russo, C. V. (2004) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(05)82621-0 · Cited by 67
Blume, M., & Appel, A. W. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/325478.325518 · Cited by 67
Liskov, B. H. (1996) · ACM eBooks · doi:10.1145/234286.1057826 · Cited by 66
Natural Deduction for Intuitionistic Non-commutative Linear Logic
Polakow, J., & Pfenning, F. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48959-2_21 · Cited by 65
Programming objects with ML-ART an extension to ML with abstract and record types
Rémy, D. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57887-0_102 · Cited by 62
Translucent Sums: A Foundation for Higher-Order Module Systems
Lillibridge, M. (1997) · Cited by 61
Deciding type equivalence in a language with singleton kinds
Stone, C. A., & Harper, R. W. (2000) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/325694.325724 · Cited by 61
Abstract types and the dot notation
Cardelli, L., & Leroy, X. (1990) · HAL · Cited by 60
A syntactic theory of type generativity and sharing
Leroy, X. (1996) · Journal of Functional Programming · doi:10.1017/s0956796800001933 · Cited by 60
Principal type schemes for functional programs with overloading and subtyping
Smith, G. S. (1994) · Science of Computer Programming · doi:10.1016/0167-6423(94)00020-4 · Cited by 59
A semantics for higher-order functors
MacQueen, D. B., & Tofte, M. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57880-3_27 · Cited by 58
Using parameterized signatures to express modular structure
Jones, M. P. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237731 · Cited by 57
Relaxing the Value Restriction
Garrigue, J. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24754-8_15 · Cited by 56
Type-preserving garbage collectors
Wang, D. C., & Appel, A. W. (2001) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/360204.360218 · Cited by 55
Nielson, F., Nielson, H. R., & Seidl, H. (2002) · Cited by 53
A Systematic Approach to Static Access Control
Pottier, F., Skalka, C., & Smith, S. F. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45309-1_3 · Cited by 48
Relevant and substructural logics
Restall, G. (2006) · Handbook of the history of logic · doi:10.1016/s1874-5857(06)80030-0 · Cited by 48
Operational interpretations of linear logic
Turner, D. N., & Wadler, P. L. (1999) · Theoretical Computer Science · doi:10.1016/s0304-3975(99)00054-7 · Cited by 47
What is a purely functional language?
Sabry, A. (1998) · Journal of Functional Programming · doi:10.1017/s0956796897002943 · Cited by 47
Pure Type Systems with definitions
Severi, P. G., & Poll, E. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58140-5_30 · Cited by 46
Tiuryn, J. (2003) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1992.185543 · Cited by 46
Checking algorithms for Pure Type Systems
Jutting, L. S. V. B., McKinna, J., & Pollack, R. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58085-9_71 · Cited by 42
Parameter-passing and the lambda calculus
Crank, E., & Felleisen, M. (1991) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/99583.99616 · Cited by 39
A type theory for memory allocation and data layout
Petersen, L., Harper, R. W., Crary, K., & Pfenning, F. (2003) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/604131.604147 · Cited by 38
Monnier, S., Saha, B., & Shao, Z. (2001) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/378795.378817 · Cited by 37
Corrigendum: complete type interference for simple objects
Wand, M. (2003) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1988.5111 · Cited by 36
A functional representation of data structures with a hole
Minamide, Y. (1998) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/268946.268953 · Cited by 33
Odersky, M. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55253-7_23 · Cited by 32
Typechecking dependent types and subtypes
Cardelli, L. (1988) · Lecture notes in computer science · doi:10.1007/3-540-19129-1_2 · Cited by 30
The logical approach to stack typing
Ahmed, A. J., & Walker, D. (2003) · Types In Languages Design And Implementation · doi:10.1145/604174.604185 · Cited by 29
Reasoning about hierarchical storage
Ahmed, A. J., Jia, L., & Walker, D. (2003) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.2003.1210043 · Cited by 28
Semmelroth, M., & Sabry, A. (1999) · Proceedings of the fourth ACM SIGPLAN international conference on Functional programming · doi:10.1145/317636.317777 · Cited by 28
Algorithms for Equality and Unification in the Presence of Notational Definitions
Pfenning, F., & Schürmann, C. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48167-2_13 · Cited by 24
Constraints in Term Algebras (Short Survey)
Comon, H. (1994) · Workshops in computing · doi:10.1007/978-1-4471-3227-1_9 · Cited by 9
Cited by
Stateful Contracts for Affine Types
Tov, J. A., & Pucella, R. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-11957-6_29 · Cited by 43
Really Natural Linear Indexed Type Checking
de Amorim, A. A., Gaboardi, M., Gallego Arias, E. J., & Hsu, J. (2014) · Proceedings of the 26nd 2014 International Symposium on Implementation and Application of Functional Languages · doi:10.1145/2746325.2746335 · Cited by 25
Metadata
- Venue
- The MIT Press eBooks
- Publisher
- The MIT Press
- Published
- 2004-12-23
- OpenAlex
- W1553136405
- Cited by
- 348
- References
- 156
- FWCI
- 9.87
- Type
- book
- 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.