The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
From system F to typed assembly language
Open accessAbstract
We motivate the design of typed assembly language (TAL) and present a type-preserving ttranslation from Systemn F to TAL. The typed assembly language we pressent is based on a conventional RISC assembly language, but its static type sytem provides support for enforcing high-level language abstratctions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violatet these abstractionsl In addition, the typing constructs admit many low-level compiler optimiztaions. Our translation to TAL is specified as a sequence of type-preserving transformations, including CPS and closure conversion phases; type-correct source programs are mapped to type-correct assembly language. A key contribution is an approach to polymorphic closure conversion that is considerably simpler than previous work. The compiler and typed assembly lanugage provide a fully automatic way to produce certified code, suitable for use in systems where unstrusted and potentially malicious code must be checked for safety before execution.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
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
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
The Definition of Standard ML (Revised)
Milner, R., Harper, R. W., MacQueen, D. B., & Tofte, M. (1997) · Cited by 985
Extensibility safety and performance in the SPIN operating system
Bershad, B. N., Savage, S., Pardyak, P., Sirer, E. G., Fiuczynski, M. E., Becker, D., Chambers, C., & Eggers, S. (1995) · Proceedings of the fifteenth ACM symposium on Operating systems principles - SOSP '95 · doi:10.1145/224056.224077 · Cited by 955
Appel, A. W. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511609619 · Cited by 824
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
Garbage collection in an uncooperative environment
Boehm, H., & Weiser, M. (1988) · Software: Practice and Experience · doi:10.1002/spe.4380180902 · Cited by 627
Girard, J.-Y. (1971) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)70843-7 · Cited by 592
Wadler, P. (1990) · Proceedings of the 1990 ACM conference on LISP and functional programming · doi:10.1145/91556.91592 · Cited by 576
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
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
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
(1990) · Cited by 392
Representing Control: a Study of the CPS Transformation
Danvy, O., & Filinski, A. (1992) · Mathematical Structures in Computer Science · doi:10.1017/s0960129500001535 · Cited by 352
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
Self-citationEliminating array bound checking through dependent types
Xi, H., & Pfenning, F. (1998) · Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation · doi:10.1145/277650.277732 · Cited by 284
Appel, A. W., & MacQueen, D. B. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-54444-5_83 · Cited by 242
Launchbury, J., & Peyton Jones, S. L. (1995) · LISP and Symbolic Computation · doi:10.1007/bf01018827 · Cited by 185
TALx86: A Realistic Typed Assembly Language∗
Morrisett, G., Crary, K., Glew, N., Grossman, D., Samuels, R. J., Frederick Smith, Y., Walker, D., Weirich, S., & Zdancewic, S. (1999) · Cited by 183
Self-citationNecula, G. C., & Lee, P. (1998) · Cited by 174
Crary, K., & Weirich, S. (1999) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/317636.317906 · Cited by 101
Self-citationWadler, P. L. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57182-5_12 · Cited by 85
Type-safe linking and modular assembly language
Glew, N., & Morrisett, G. (1999) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/292540.292563 · Cited by 80
Self-citationExplicit polymorphism and CPS conversion
Harper, R. W., & Lillibridge, M. (1993) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/158511.158630 · Cited by 69
Cited by
LLVM: A compilation framework for lifelong program analysis & transformation
Lattner, C., & Adve, V. (2004) · International Symposium on Code Generation and Optimization, 2004. CGO 2004. · doi:10.1109/cgo.2004.1281665 · Cited by 2,681
Language-based information-flow security
Sabelfeld, A., & Myers, A. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.806121 · Cited by 1,907
Formal verification of a realistic compiler
Leroy, X. (2009) · Communications of the ACM · doi:10.1145/1538788.1538814 · Cited by 1,187
Control-flow integrity principles, implementations, and applications
Abadi, M., Budiu, M., Erlingsson, Ú., & Ligatti, J. (2009) · ACM Transactions on Information and System Security · doi:10.1145/1609956.1609960 · Cited by 795
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
Leroy, X. (2006) · Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1111037.1111042 · Cited by 661
Metadata
- Authors
- Morrisett, G., Walker, D., Crary, K., & Glew, N.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1999-05
- Volume
- 21
- Issue
- 3
- Pages
- 527-568
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2069107692
- Cited by
- 584
- References
- 27
- FWCI
- 39.88
- Type
- journal article
- Language
- en
- Open access
- bronze
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.