The essence of compiling with continuations

Flanagan, Cormac; Sabry, Amr; Duba, Bruce F.; Felleisen, Matthias

doi:10.1145/173262.155113

Cited by 198 publications

(202 citation statements)

References 11 publications

Supporting

Mentioning

201

Contrasting

Order By: Relevance

“…We think that our axioms are reasonably simple, and we expect they can be a practical tool for reasoning about call-by-value programs involving recursion, just in the same way as the equational theory of the computational lambda calculus is the theoretical basis of the theory of A-normal forms [16,6].…”

Section: Conclusion and Further Workmentioning

confidence: 99%

“…Continuation-Passing Style translation into the λβη-calculus [16] and has been proved useful for reasoning about call-by-value programs. In particular, it can be seen as the theoretical backbone of (the typed version of) the theory of A-normal forms [6], which enables us to optimise call-by-value programs directly without performing the CPS translation.…”

Section: The Call-by-value Calculimentioning

confidence: 99%

See 1 more Smart Citation

Axioms for Recursion in Call-by-Value

Hasegawa

Kakutani

2001

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.We propose an axiomatization of fixpoint operators in typed call-by-value programming languages, and give its justifications in two ways. First, it is shown to be sound and complete for the notion of uniform T -fixpoint operators of Simpson and Plotkin. Second, the axioms precisely account for Filinski's fixpoint operator derived from an iterator (infinite loop constructor) in the presence of first-class controls, provided that we define the uniformity principle on such an iterator via a notion of effect-freeness (centrality). We also investigate how these two results are related in terms of the underlying categorical models.

show abstract

Section: Conclusion and Further Workmentioning

confidence: 99%

Section: The Call-by-value Calculimentioning

confidence: 99%

Axioms for Recursion in Call-by-Value

Hasegawa

Kakutani

2001

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Note that the grammar insists that, e.g., in an application, both the function and the arguments are values, analogously when acquiring a lock, etc. This form of representation is known as a-normal form [11].…”

Section: Calculusmentioning

confidence: 99%

Deadlock Checking by Data Race Detection

Pun

Steffen

Stolz

2013

Fundamentals of Software Engineering

View full text Add to dashboard Cite

Abstract. Deadlocks are a common problem in programs with lockbased concurrency and are hard to avoid or even to detect. One way for deadlock prevention is to statically analyze the program code to spot sources of potential deadlocks.We reduce the problem of deadlock checking to race checking, another prominent concurrency-related error for which good (static) checking tools exist. The transformation uses a type and effect-based static analysis, which analyzes the data flow in connection with lock handling to find out control-points that are potentially part of a deadlock. These controlpoints are instrumented appropriately with additional shared variables, i.e., race variables injected for the purpose of the race analysis. To avoid overly many false positives for deadlock cycles of length longer than two, the instrumentation is refined by adding "gate locks". The type and effect system and the transformation are formally given. We prove our analysis sound using a simple, concurrent calculus with re-entrant locks.

show abstract

“…3. To simplify the presentation we have restricted to the A-normal forms [10] from Fig. 2; transitions for general expressions can be derived by reducing them to A-normal form.…”

Section: Fig 3 αMl Operational Semanticsmentioning

confidence: 99%

Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming

Lakin

Pitts

2009

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operational semantics, but is excluded by the common representation of binding as meta-level λ-abstraction. Drawing upon ideas from functional logic programming, we represent such definitions with aliasing as recursively defined functions in a higher-order typed functional programming language that extends core ML with types for name-binding, a type of "semi-decidable propositions" and existential quantification for types with decidable equality. We show that the representation is sound and complete with respect to the language's operational semantics, which combines the use of evaluation contexts with constraint programming. We also give a new and simple proof that the associated constraint problem is NP-complete.

show abstract

The essence of compiling with continuations

Abstract: In order to simplify the compilation process, many compilers for higher-order languages use the continuation-

Cited by 198 publications

References 11 publications

Axioms for Recursion in Call-by-Value

Axioms for Recursion in Call-by-Value

Deadlock Checking by Data Race Detection

Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming

Contact Info

Product

Resources

About