<abstract xmlns="http://www.w3.org/1999/xhtml"><p> Compilers generate from the procedure or function call instruction a code that builds up an ”activation record” into the stack memory in run time. At execution of this code the formal parameters, local variables, data of visibility and the scope are pushed into the activation record, and in this record there are fields for the return address and the return value as well. In case of intensive recursive calls this is the reason of the frequent occurrences of the stack-overflow error messages. The classical technique for fixing such stack-overflows is to write programs in stackless programming style using tail recursive calls; the method is usually realised by Continuation Passing Style. This paper describes this style and gives an introduction to the new, special purpose stackless programming language Miller, which provides methods to avoid stack-overflow errors.</p></abstract>

Compilers generate from the procedure or function call instruction a code that builds up an ”activation record” into the stack memory in run time. At execution of this code the formal parameters, local variables, data of visibility and the scope are pushed into the activation record, and in this record there are fields for the return address and the return value as well. In case of intensive recursive calls this is the reason of the frequent occurrences of the stack-overflow error messages. The classical technique for fixing such stack-overflows is to write programs in stackless programming style using tail recursive calls; the method is usually realised by Continuation Passing Style. This paper describes this style and gives an introduction to the new, special purpose stackless programming language Miller, which provides methods to avoid stack-overflow errors.

Stackless programming in Miller

Eötvös Loránd University Faculty of Informatics Budapest, Hungary

Acta Universitatis Sapientiae, Informatica

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

{"article-title":"Stackless programming in Miller"}

Compilers generate from the procedure or function call instruction a code that builds up an ”activation record” into the stack memory in run time. At execution...

Stackless programming in Miller

Online veröffentlicht: 30. Mai 2014

Seitenbereich: 167 - 183

Eingereicht: 06. Aug. 2013

DOI: https://doi.org/10.2478/ausi-2014-0009

Schlüsselwörter
tail recursion, continuation passing style, stackless programming, programming language Miller

© 2014

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Stackless programming in Miller

Online veröffentlicht: 30. Mai 2014

Seitenbereich: 167 - 183

Eingereicht: 06. Aug. 2013

DOI: https://doi.org/10.2478/ausi-2014-0009

Schlüsselwörtertail recursion, continuation passing style, stackless programming, programming language Miller

© 2014

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Schlüsselwörter
tail recursion, continuation passing style, stackless programming, programming language Miller