From natural semantics to C: A formal derivation of two STG machines

Encina, Alberto de la; Peña, Ricardo

doi:10.1017/s0956796808006746

Cited by 11 publications

(6 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The PE STG machine is in reality a hybrid machine, which is apparent in its original, three-stack formulation [9]: the machine is PE in the argument stack, but it is EA in the return and update stacks. The equivalence of two simpler variants of the EA and PE STG machines has been shown by Encina and Peña [8] by deriving both machines from a single natural semantics. Piróg and Biernacki [13] used a technique based on Danvy's functional correspondence to derive the PE STG machine from a big-step operational semantics.…”

Section: Discussionmentioning

confidence: 95%

From Push/Enter to Eval/Apply by Program Transformation

Piróg

Gibbons

2016

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Push/enter and eval/apply are two calling conventions used in implementations of functional languages. In this paper, we explore the following observation: when considering functions with multiple arguments, the stack under the push/enter and eval/apply conventions behaves similarly to two particular implementations of the list datatype: the regular cons-list and a form of lists with lazy concatenation respectively. Along the lines of Danvy et al.'s functional correspondence between definitional interpreters and abstract machines, we use this observation to transform an abstract machine that implements push/enter into an abstract machine that implements eval/apply. We show that our method is flexible enough to transform the push/enter Spineless Tagless G-machine (which is the semantic core of the GHC Haskell compiler) into its eval/apply variant.

show abstract

Section: Discussionmentioning

confidence: 95%

From Push/Enter to Eval/Apply by Program Transformation

Piróg

Gibbons

2016

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…As described in Section 4, this type-and-effect system successfully produces resource bounds for examples that could not previously be analysed. Our cost model is based on Launchbury's natural semantics for lazy evaluation [5], as subsequently refined by Sestoft [4], de la Encina and Peña-Marì [10,11]. The proof technique used in Section 5.6 for establishing correspondence between the indirections semantics and the standard one is based on work by Sánchez-Gil, Hidalgo-Herrero and Ortega-Mallén [9].…”

Section: Soundness Of the Proof Systemmentioning

confidence: 99%

Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages

Vasconcelos

Jost

Florido

et al. 2015

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. This paper presents a novel type-and-effect analysis for predicting upper-bounds on memory allocation costs for co-recursive definitions in a simple lazily-evaluated functional language. We show the soundness of this system against an instrumented variant of Launchbury's semantics for lazy evaluation which serves as a formal cost model. Our soundness proof requires an intermediate semantics employing indirections. Our proof of correspondence between these semantics that we provide is thus a crucial part of this work. The analysis has been implemented as an automatic inference system. We demonstrate its effectiveness using several example programs that previously could not be automatically analysed.

show abstract

“…As described above, we build heavily on Launchbury's natural semantics for lazy evaluation [30], as subsequently adapted by Sestoft, and exploit ideas that were developed by de la Encina and Peña-Marí [14,15]. There is a significant body of other work on the semantics of call-by-need evaluation.…”

Section: Related Workmentioning

confidence: 99%

Automatic amortised analysis of dynamic memory allocation for lazy functional programs

et al. 2012

View full text Add to dashboard Cite

This paper describes the first successful attempt, of which we are aware, to define an automatic, type-based static analysis of resource bounds for lazy functional programs. Our analysis uses the automatic amortisation approach developed by Hofmann and Jost, which was previously restricted to eager evaluation. In this paper, we extend this work to a lazy setting by capturing the costs of unevaluated expressions in type annotations and by amortising the payment of these costs using a notion of lazy potential. We present our analysis as a proof system for predicting heap allocations of a minimal functional language (including higher-order functions and recursive data types) and define a formal cost model based on Launchbury's natural semantics for lazy evaluation. We prove the soundness of our analysis with respect to the cost model. Our approach is illustrated by a number of representative and non-trivial examples that have been analysed using a prototype implementation of our analysis.

show abstract

From natural semantics to C: A formal derivation of two STG machines

Cited by 11 publications

References 18 publications

From Push/Enter to Eval/Apply by Program Transformation

From Push/Enter to Eval/Apply by Program Transformation

Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages

Automatic amortised analysis of dynamic memory allocation for lazy functional programs

Contact Info

Product

Resources

About