Article

Free access

The spineless tagless G-machine

Authors:

FPCA '89: Proceedings of the fourth international conference on Functional programming languages and computer architecture

Pages 184 - 201

https://doi.org/10.1145/99370.99385

Published: 01 November 1989 Publication History

PDF eReader

References

[1]

AV Aho, R Sethi ~ JD Ullman {1986}, Compilers - principles, techniques and tools, Addison Wesley.

Digital Library

Google Scholar

[2]

AW Appel, JR Ellis ~ Kai Li {June 1988}, "Real-time concurrent collection on stock multiprocessors," in Proc SIGPLAN Conference on Programming Language Design and Implementation, Atlanta, ACM, 11-20.

Digital Library

Google Scholar

[3]

Lennart Augustsson {1987}, "Compiling lazy functional languages, part II," PhD thesis, Dept Comp Sci, Chalmers University, Sweden.

Google Scholar

[4]

Geoff Burn, Simon L Peyton Jones ~ John Robson {July 1988}, "The Spineless G-machine," in Proc ACM Conference on Lisp and Functional Programming, Snowbird, 244-258.

Digital Library

Google Scholar

[5]

Luca Cardelli {Jan 1983}, "The functional abstract machine," Polymorphism 1.

Google Scholar

[6]

G Cousineau, PL Curien ~ M Mauny {Sept 1985}, "The Categorical Abstract Machine," in Functional Programming Languages and Computer Architecture, Nancy, JP Jouatinaud, ed., LNCS 201, Springer Verlag, 50-64.

Digital Library

Google Scholar

[7]

AJT Davie ~ DJ McNally {Jan 1989}, "CASE - a lazy version of an SECD machine with a flat environment," Dept of Computer Science, University of St Andrews.

Google Scholar

[8]

Jon Fairbairn ~ Stuart Wray {Sept 1987}, "TIM - a simple lazy abstract machine to execute supercombinators," in Proc IFIP conference on Functional Programming Languages and Computer Architecture, Portland, G Kahn, ed., Springer Verlag LNCS 274, 34-45.

Digital Library

Google Scholar

[9]

Paul Hudak ~ Phil Wadlet e2 al{Dec 1988}, "Report on the functional programming language Haskell," Dept. of Computer Science, Yale University.

Google Scholar

[10]

T Johnsson {Nov 1988}, "The v-G-machine," Dept of Computer Science, Chalmers University.

Google Scholar

[11]

Thomas Johnsson {1987}, "Compiling lazy functional languages," PhD thesis, PMG, Chalmers University, Goteborg, Sweden.

Google Scholar

[12]

RB Kieburtz {Ott 1987}, "A RISC architecture for symbolic computation," in Proc ASPLOS II.

Crossref

Google Scholar

[13]

Erik Meijer {Sept 1988}, "Generalised expression evaluation," in Proc workshop on implementation of lazy functional languages, Aspenas.

Google Scholar

[14]

Simon L Peyton Jones {1987}, The implementation of functional programming languages, Prentice Hall.

Digital Library

Google Scholar

[15]

Simon L Peyton Jones, Chris Clack, Jon Salkild ~ Mark Hardie. {Sept 1987}, "GRIP - a highperformance architecture for parallel graph reduction," in Proc IFIP conference on Functional Programming Languages and Computer Architecture, Portland, G Kahn, ed., Springer Verlag LNCS 274, 98-112.

Digital Library

Google Scholar

[16]

David Turner {Sept 1985}, "Miranda - a non-strict functional language with polymorphic types," in ACM Conf on Func Prog and Comp Arch, Nancy.

Digital Library

Google Scholar

Cited By

View all

Bračevac OWei GJia SAbeysinghe SJiang YBao YRompf T(2023)Graph IRs for Impure Higher-Order Languages: Making Aggressive Optimizations Affordable with Precise Effect DependenciesProceedings of the ACM on Programming Languages10.1145/36228137:OOPSLA2(400-430)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622813
Kanabar HVivien SAbrahamsson OMyreen MNorrish MPohjola JZanetti R(2023)PureCake: A Verified Compiler for a Lazy Functional LanguageProceedings of the ACM on Programming Languages10.1145/35912597:PLDI(952-976)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591259
Libby S(2023)RICE: An Optimizing Curry CompilerPractical Aspects of Declarative Languages10.1007/978-3-031-24841-2_1(3-19)Online publication date: 8-Jan-2023
https://doi.org/10.1007/978-3-031-24841-2_1
Show More Cited By

Recommendations

The spineless G-machine
LFP '88: Proceedings of the 1988 ACM conference on LISP and functional programming

Recent developments in functional language implementations have resulted in the G-machine, a programmed graph-reduction machine. Taking this as a basis, we introduce an optimised method of performing graph reduction, which does not need to build the ...
The spineless tagless G-machine, naturally
ICFP '98: Proceedings of the third ACM SIGPLAN international conference on Functional programming

The application of natural semantic specifications of lazy evaluation to areas such as usage analysis, formal profiling and abstract machine construction has shown it to be a useful formalism. This paper introduces several variants and extensions of ...
Compiling Lazy Functional Programs Based on the Spineless Tagless G-Machine for the Java Virtual Machine
FLOPS '01: Proceedings of the 5th International Symposium on Functional and Logic Programming

A systematic method of compiling lazy functional programs based on the Spineless Tagless G-machine (STGM) is presented for the Java Virtual Machine (JVM). A new specification of the STGM, which consists of a compiler and a reduction machine, is ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

FPCA '89: Proceedings of the fourth international conference on Functional programming languages and computer architecture

November 1989

395 pages

ISBN:0897913280

DOI:10.1145/99370

Chairman:
Joseph E. Stoy

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: 01 November 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

FPCA89

Sponsor:

SIGPLAN
IFIP WG 2.8
SIGARCH

FPCA89: The International Conference on Functional Programming Languages & Computer Architectures

September 11 - 13, 1989

Imperial College, London, United Kingdom

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

53
Total Citations
View Citations
1,646
Total Downloads

Downloads (Last 12 months)482
Downloads (Last 6 weeks)58

Reflects downloads up to 17 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bračevac OWei GJia SAbeysinghe SJiang YBao YRompf T(2023)Graph IRs for Impure Higher-Order Languages: Making Aggressive Optimizations Affordable with Precise Effect DependenciesProceedings of the ACM on Programming Languages10.1145/36228137:OOPSLA2(400-430)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622813
Kanabar HVivien SAbrahamsson OMyreen MNorrish MPohjola JZanetti R(2023)PureCake: A Verified Compiler for a Lazy Functional LanguageProceedings of the ACM on Programming Languages10.1145/35912597:PLDI(952-976)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591259
Libby S(2023)RICE: An Optimizing Curry CompilerPractical Aspects of Declarative Languages10.1007/978-3-031-24841-2_1(3-19)Online publication date: 8-Jan-2023
https://doi.org/10.1007/978-3-031-24841-2_1
Ghica D(2021)Operational Semantics with Hierarchical Abstract Syntax GraphsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.334.1334(1-10)Online publication date: 8-Feb-2021
https://doi.org/10.4204/EPTCS.334.1
Antoy SJost A(2017)A New Functional-Logic Compiler for Curry: SpriteLogic-Based Program Synthesis and Transformation10.1007/978-3-319-63139-4_6(97-113)Online publication date: 25-Jul-2017
https://doi.org/10.1007/978-3-319-63139-4_6
Wang YNunez DFisher K(2016)Autobahn: using genetic algorithms to infer strictness annotationsACM SIGPLAN Notices10.1145/3241625.297600951:12(114-126)Online publication date: 8-Sep-2016
https://dl.acm.org/doi/10.1145/3241625.2976009
Wang YNunez DFisher KMainland G(2016)Autobahn: using genetic algorithms to infer strictness annotationsProceedings of the 9th International Symposium on Haskell10.1145/2976002.2976009(114-126)Online publication date: 8-Sep-2016
https://dl.acm.org/doi/10.1145/2976002.2976009
Koopman PPlasmeijer RJansen J(2014)Church Encoding of Data Types Considered Harmful for ImplementationsProceedings of the 26nd 2014 International Symposium on Implementation and Application of Functional Languages10.1145/2746325.2746330(1-12)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1145/2746325.2746330
Chang SFelleisen M(2012)The call-by-need lambda calculus, revisitedProceedings of the 21st European conference on Programming Languages and Systems10.1007/978-3-642-28869-2_7(128-147)Online publication date: 24-Mar-2012
https://dl.acm.org/doi/10.1007/978-3-642-28869-2_7
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
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

The spineless G-machine

The spineless tagless G-machine, naturally

Compiling Lazy Functional Programs Based on the Spineless Tagless G-Machine for the Java Virtual Machine