Implementation of the typed call-by-value λ-calculus using a stack of regions

Implementation of the typed call-by-value λ-calculus using a stack of regions (1994)

by Mads Tofte

Venue:	In ACM Symposium on Principles of Programming Languages
Citations:	53 - 0 self

Datum	Value	Source
TITLE	Implementation of the typed call-by-value λ-calculus using a stack of regions	INFERENCE
AUTHOR NAME	Mads Tofte	SVM HeaderParse 0.2
AUTHOR AFFIL	Jean-Pierre Talpin, European Computer-Industry Research Center †	SVM HeaderParse 0.2
ABSTRACT	We present a translation scheme for the polymorphically typed call-by-value λ-calculus. All runtime values, including function closures, are put into regions. The store consists of a stack of regions. Region inference and effect inference are used to infer where regions can be allocated and de-allocated. Recursive functions are handled using a limited form of polymorphic recursion. The translation is proved correct with respect to a store semantics, which models a regionbased run-time system. Experimental results suggest that regions tend to be small, that region allocation is frequent and that overall memory demands are usually modest, even without garbage collection. 1	SVM HeaderParse 0.2
YEAR	1994	INFERENCE
VENUE	In ACM Symposium on Principles of Programming Languages	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	188--201	INFERENCE
CITATIONS	30 found	ParsCit 1.0