The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Implementation of the typed call-by-value λ-calculus using a stack of regions
Open accessAbstract
We present a translation scheme for the polymorphically typed call-by-value λ-calculus. All runtime values, including function closures, are put into regions. The store consists of a stack of regions. Region inference and effect inference are used to infer where regions can be allocated and de-allocated. Recursive functions are handled using a limited form of polymorphic recursion. The translation is proved correct with respect to a store semantics, which models as a region-based run-time system. Experimental results suggest that regions tend to be small, that region allocation is frequent and that overall memory demands are usually modest, even without garbage collection.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
Odeh, R. E., & Knuth, D. E. (1969) · Journal of the American Statistical Association · doi:10.2307/2283757 · Cited by 2,525
Milner, R., Harper, R., MacQueen, D., & Tofte, M. (1997) · The MIT Press eBooks · doi:10.7551/mitpress/2319.001.0001 · Cited by 2,419
Self-citationA 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
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
Appel, A. W. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511609619 · Cited by 824
Paulson, L. C. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511811326 · Cited by 593
List processing in real time on a serial computer
Baker, H. G. (1978) · Communications of the ACM · doi:10.1145/359460.359470 · Cited by 592
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
Type inference with polymorphic recursion
Henglein, F. (1993) · ACM Transactions on Programming Languages and Systems · doi:10.1145/169701.169692 · Cited by 221
Dijkstra, E. (1960) · Numerische Mathematik · doi:10.1007/bf01386232 · Cited by 167
Cited by
Type-based race detection for Java
Flanagan, C., & Freund, S. N. (2000) · Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation · doi:10.1145/349299.349328 · Cited by 446
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
Language support for fast and reliable message-based communication in singularity OS
Fähndrich, M., Aiken, M., Hawblitzel, C., Hodson, O., Hunt, G., Larus, J. R., & Levi, S. (2006) · Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 · doi:10.1145/1217935.1217953 · Cited by 289
DeLine, R., & Fähndrich, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24851-4_21 · Cited by 253
Semmelroth, M., & Sabry, A. (1999) · Proceedings of the fourth ACM SIGPLAN international conference on Functional programming · doi:10.1145/317636.317777 · Cited by 28
Metadata
- Authors
- Tofte, M., & Talpin, J.-P.
- Venue
- Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94
- Publisher
- ACM Press
- Published
- 1994
- Pages
- 188-201
- OpenAlex
- W2129133667
- Cited by
- 337
- References
- 14
- FWCI
- 15.40
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Implementation of the typed call-by-value λ-calculus using a stack of regions. https://app.cochat.ai/papers/10.1145/174675.177855
- The paper
- Tofte, M., & Talpin, J.-P. (1994). Implementation of the typed call-by-value λ-calculus using a stack of regions. Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94. https://doi.org/10.1145/174675.177855
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.