Article

Formally deriving an STG machine

Authors:

PPDP '03: Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming

Pages 102 - 112

https://doi.org/10.1145/888251.888262

Published: 27 August 2003 Publication History

Get Access

Abstract

Starting from P. Sestoft semantics for lazy evaluation, we define a new semantics in which normal forms consist of variables pointing to lambdas or constructions. This is in accordance with the more recent changes in the Spineless Tagless G-machine (STG) machine, where constructions only appear in closures (lambdas only appeared in closures already in previous versions). We prove the equivalence between the new semantics and Sestoft's. Then, a sequence of STG machines are derived, formally proving the correctness of each derivation. The last machine consists of a few imperative instructions and its distance to a conventional language is minimal.The paper also discusses the differences between the final machine and the actual STG machine implemented in the Glasgow Haskell Compiler.

References

[1]

A. at URL: http://www.haskell.org/ghc/.

Google Scholar

[2]

A. Encina and R. Pena. Proving the Correctness of the STG Machine. In Implementation of Functional Languages, IFL'01. Selected Papers. LNCS 2312, pages 88--104. Springer-Verlag, 2002.

Digital Library

Google Scholar

[3]

S. P. Jones and J. Launchbury. Unboxed values as first class citizens in a non-strict functional language. Conference on Functional Programming Languages and Computer Architecture FPCA'91, LNCS 523, September 1991.

Digital Library

Google Scholar

[4]

J. Launchbury. A Natural Semantics for Lazy Evaluation. In Proc. Conference on Principles of Programming Languages, POPL'93. ACM, 1993.

Digital Library

Google Scholar

[5]

J. Mountjoy. The Spineless Tagless G-machine, Naturally. In Third International Conference on Functional Programming, ICFP'98, Baltimore. ACM Press, 1998.

Digital Library

Google Scholar

[6]

S. L. Peyton Jones. Implementing Lazy Functional Languages on Stock Hardware: the Spineless Tagless G-machine, Version 2.5. Journal of Functional Programming, 2(2):127--202, April 1992.

Crossref

Google Scholar

[7]

S. L. Peyton Jones, C. V. Hall, K. Hammond, W. D. Partain, and P. L. Wadler. The Glasgow Haskell Compiler: A Technical Overview. In Joint Framework for Inf. Technology, Keele, pages 249--257, 1993.

Google Scholar

[8]

S. L. Peyton Jones and J. Hughes, editors. Report on the Programming Language Haskell 98. URL http://www.haskell.org, February 1999.

Google Scholar

[9]

S. L. Peyton Jones, S. Marlow, and A. Reid. The STG Runtime System (revised). http://www.haskell.org/ghc/docs, 1999.

Google Scholar

[10]

P. Sestoft. Deriving a Lazy Abstract Machine. Journal of Functional Programming, 7(3):231--264, May 1997.

Digital Library

Google Scholar

Cited By

View all

Vasconcelos PJost SFlorido MHammond K(2015)Type-Based Allocation Analysis for Co-recursion in Lazy Functional LanguagesCompiler Construction10.1007/978-3-662-46669-8_32(787-811)Online publication date: 2015
https://doi.org/10.1007/978-3-662-46669-8_32
Simões HVasconcelos PFlorido MJost SHammond K(2012)Automatic amortised analysis of dynamic memory allocation for lazy functional programsACM SIGPLAN Notices10.1145/2398856.236457547:9(165-176)Online publication date: 9-Sep-2012
https://dl.acm.org/doi/10.1145/2398856.2364575
Simões HVasconcelos PFlorido MJost SHammond KThiemann PFindler R(2012)Automatic amortised analysis of dynamic memory allocation for lazy functional programsProceedings of the 17th ACM SIGPLAN international conference on Functional programming10.1145/2364527.2364575(165-176)Online publication date: 9-Sep-2012
https://dl.acm.org/doi/10.1145/2364527.2364575
Show More Cited By

Index Terms

Formally deriving an STG machine
1. Software and its engineering
  1. Software notations and tools
2. Theory of computation
  1. Semantics and reasoning
    1. Program semantics
      1. Operational semantics

Recommendations

Certified abstract machines for skeletal semantics
CPP 2022: Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs

Skeletal semantics is a framework to describe semantics of programming languages. We propose an automatic generation of a certified OCaml interpreter for any language written in skeletal semantics. To this end, we introduce two new interpretations, i.e.,...
Operational semantics-directed compilers and machine architectures

We consider the task of automatically constructing intermediate-level machine architectures and compilers generating code for these architectures, given operational semantics for source languages. We use operational semantics in the form of abstract ...
A functional correspondence between call-by-need evaluators and lazy abstract machines

We bridge the gap between compositional evaluators and abstract machines for the lambda-calculus, using closure conversion, transformation into continuation-passing style, and defunctionalization of continuations. This article is a followup of our ...

Comments

Information & Contributors

Information

Published In

PPDP '03: Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming

August 2003

292 pages

ISBN:1581137052

DOI:10.1145/888251

Conference Chair:
Konstantinos Sagonas
Uppsala University, SW
,
Program Chair:
Dale Miller
INRIA/Futurs & Ecole Polytechnique, France

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 August 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PPDP03

Sponsor:

PPDP03: 5th International Conference on Principles and Practice of Declarative Programming 2003

August 27 - 29, 2003

Uppsala, Sweden

Acceptance Rates

PPDP '03 Paper Acceptance Rate 24 of 48 submissions, 50%;

Overall Acceptance Rate 230 of 486 submissions, 47%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
284
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)2

Reflects downloads up to 30 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Vasconcelos PJost SFlorido MHammond K(2015)Type-Based Allocation Analysis for Co-recursion in Lazy Functional LanguagesCompiler Construction10.1007/978-3-662-46669-8_32(787-811)Online publication date: 2015
https://doi.org/10.1007/978-3-662-46669-8_32
Simões HVasconcelos PFlorido MJost SHammond K(2012)Automatic amortised analysis of dynamic memory allocation for lazy functional programsACM SIGPLAN Notices10.1145/2398856.236457547:9(165-176)Online publication date: 9-Sep-2012
https://dl.acm.org/doi/10.1145/2398856.2364575
Simões HVasconcelos PFlorido MJost SHammond KThiemann PFindler R(2012)Automatic amortised analysis of dynamic memory allocation for lazy functional programsProceedings of the 17th ACM SIGPLAN international conference on Functional programming10.1145/2364527.2364575(165-176)Online publication date: 9-Sep-2012
https://dl.acm.org/doi/10.1145/2364527.2364575
Pirog MBiernacki D(2010)A systematic derivation of the STG machine verified in CoqACM SIGPLAN Notices10.1145/2088456.186352845:11(25-36)Online publication date: 30-Sep-2010
https://dl.acm.org/doi/10.1145/2088456.1863528
Pirog MBiernacki DGibbons J(2010)A systematic derivation of the STG machine verified in CoqProceedings of the third ACM Haskell symposium on Haskell10.1145/1863523.1863528(25-36)Online publication date: 30-Sep-2010
https://dl.acm.org/doi/10.1145/1863523.1863528
de la Encina ALlana LRubio FHidalgo-Herrero MLeuschel MPodelski A(2007)Observing intermediate structures in a parallel lazy functional languageProceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming10.1145/1273920.1273935(109-120)Online publication date: 14-Jul-2007
https://dl.acm.org/doi/10.1145/1273920.1273935
de la Encina ALlana LRubio F(2006)Introducing debugging capabilities to natural semanticsProceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics10.5555/1760700.1760720(195-208)Online publication date: 27-Jun-2006
https://dl.acm.org/doi/10.5555/1760700.1760720

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Certified abstract machines for skeletal semantics

Operational semantics-directed compilers and machine architectures

A functional correspondence between call-by-need evaluators and lazy abstract machines

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations