A Tail-Recursive Semantics for Stack Inspections

Clements, John; Felleisen, Matthias

doi:10.1007/3-540-36575-3_3

Cited by 16 publications

(21 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Scheme supports first-class continuations and tail evaluation, both of which are consistent with Java [11,35], so our extended Java supports them.…”

Section: Control Flowmentioning

confidence: 85%

Fine-grained interoperability through mirrors and contracts

2005

View full text Add to dashboard Cite

As a value flows across the boundary between interoperating languages, it must be checked and converted to fit the types and representations of the target language. For simple forms of data, the checks and coercions can be immediate; for higher order data, such as functions and objects, some must be delayed until the value is used in a particular way. Typically, these coercions and checks are implemented by an ad-hoc mixture of wrappers, reflection, and dynamic predicates. We observe that 1) the wrapper and reflection operations fit the profile of mirrors, 2) the checks correspond to contracts, and 3) the timing and shape of mirror operations coincide with the timing and shape of contract operations. Based on these insights, we present a new model of interoperability that builds on the ideas of mirrors and contracts, and we describe an interoperable implementation of Java and Scheme that is guided by the model.

show abstract

“…Scheme supports first-class continuations and tail evaluation, both of which are consistent with Java [11,35], so our extended Java supports them.…”

Section: Control Flowmentioning

confidence: 85%

Fine-grained interoperability through mirrors and contracts

2005

View full text Add to dashboard Cite

show abstract

“…Clemens and Felleisen [7] present a different semantics of (eager) stack inspection on continuation CESK machines, which allows for tail-call optimizing implementations.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Stack inspection and secure program transformations

Bartoletti

Degano

Ferrari

2004

IJIS

View full text Add to dashboard Cite

show abstract

“…However, Clements and Felleisen have shown that this is not true and that stack inspection is in fact compatible with global tail-call optimization [7]. Their observation is that the security information of multiple tail calls can be summarized in a permission table.…”

Section: Stack Inspection As a Lifted State Monadmentioning

confidence: 99%

“…They use this equational theory to formally investigate how stack inspection affects known program transformations such as inlining and tail-call optimization. Clements and Felleisen present a properly tail-call optimized semantics for stack inspection based on Fournet and Gordon's semantics [7]. This tail-call optimized semantics is given in the form of a CESK machine, which was the starting point for our work.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational Effects

Ager¹,

Danvy²,

Midtgaard³

2004

BRICS

View full text Add to dashboard Cite

Abstract. We extend our correspondence between evaluators and abstract machines from the pure setting of the λ-calculus to the impure setting of the computational λ-calculus. We show how to derive new abstract machines from monadic evaluators for the computational λ-calculus. Starting from (1) a generic evaluator parameterized by a monad and (2) a monad specifying a computational effect, we inline the components of the monad in the generic evaluator to obtain an evaluator written in a style that is specific to this computational effect. We then derive the corresponding abstract machine by closure-converting, CPS-transforming, and defunctionalizing this specific evaluator. We illustrate the construction with the identity monad, obtaining yet again the CEK machine, and with a lifted state monad, obtaining a variant of the CEK machine with error and state.In addition, we characterize the tail-recursive stack inspection presented by Clements and Felleisen at ESOP 2003 as a lifted state monad. This enables us to combine the stackinspection monad with other monads and to construct abstract machines for languages with properly tail-recursive stack inspection and other computational effects. The construction scales to other monads-including one more properly dedicated to stack inspection than the lifted state monad-and other monadic evaluators.

show abstract

A Tail-Recursive Semantics for Stack Inspections

Cited by 16 publications

References 15 publications

Fine-grained interoperability through mirrors and contracts

Fine-grained interoperability through mirrors and contracts

Stack inspection and secure program transformations

A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational Effects

Contact Info

Product

Resources

About