Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

A simplified account of polymorphic references

Published: 24 August 1994 Publication History

Abstract

No abstract available.

Cited By

View all
  • (2022)Intrinsically-typed definitional interpreters à la carteProceedings of the ACM on Programming Languages10.1145/35633556:OOPSLA2(1903-1932)Online publication date: 31-Oct-2022
  • (2020)The history of Standard MLProceedings of the ACM on Programming Languages10.1145/33863364:HOPL(1-100)Online publication date: 12-Jun-2020
  • (2017)Intrinsically-typed definitional interpreters for imperative languagesProceedings of the ACM on Programming Languages10.1145/31581042:POPL(1-34)Online publication date: 27-Dec-2017
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Information Processing Letters
Information Processing Letters  Volume 51, Issue 4
Aug. 24, 1994
51 pages
ISSN:0020-0190
Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 24 August 1994

Author Tags

  1. formal semantics
  2. functional programming
  3. programming languages
  4. references and assignment
  5. type theory

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 12 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2022)Intrinsically-typed definitional interpreters à la carteProceedings of the ACM on Programming Languages10.1145/35633556:OOPSLA2(1903-1932)Online publication date: 31-Oct-2022
  • (2020)The history of Standard MLProceedings of the ACM on Programming Languages10.1145/33863364:HOPL(1-100)Online publication date: 12-Jun-2020
  • (2017)Intrinsically-typed definitional interpreters for imperative languagesProceedings of the ACM on Programming Languages10.1145/31581042:POPL(1-34)Online publication date: 27-Dec-2017
  • (2017)Type soundness proofs with definitional interpretersACM SIGPLAN Notices10.1145/3093333.300986652:1(666-679)Online publication date: 1-Jan-2017
  • (2017)Type soundness proofs with definitional interpretersProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009866(666-679)Online publication date: 1-Jan-2017
  • (2017)Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming LanguagesundefinedOnline publication date: 1-Jan-2017
  • (2011)A typed store-passing translation for general referencesProceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1926385.1926403(147-158)Online publication date: 26-Jan-2011
  • (2011)A typed store-passing translation for general referencesACM SIGPLAN Notices10.1145/1925844.192640346:1(147-158)Online publication date: 26-Jan-2011
  • (2010)Semantic foundations for typed assembly languagesACM Transactions on Programming Languages and Systems10.1145/1709093.170909432:3(1-67)Online publication date: 16-Mar-2010
  • (2010)A theory of indirection via approximationACM SIGPLAN Notices10.1145/1707801.170632245:1(171-184)Online publication date: 17-Jan-2010
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media