Call-By-Push-Value

Levy, Paul Blain

doi:10.1007/978-94-007-0954-6

Cited by 48 publications

(44 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The intuition here is that any (active) computation has a corresponding (static) value, its "thunk". In contrast to [15], we make this passage from computations to values syntactically invisible.…”

Section: A Polymorphic Calculusmentioning

confidence: 97%

“…The intuitive difference between the two is that "a value is" and "a computation does". Technically, this intuition is supported by the vast range of semantic and operational interpretations of the framework, see [15].…”

Section: Introductionmentioning

confidence: 97%

“…It is closely related to Levy's system of call by push-value (CBPV) [15], which subsumes call-by-name and call-byvalue calculi with effects. Levy, following the lead of Filinski [5], emphasises the importance of having two general classes of types: value types, which classify "values", and computation types, which classify "computations".…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Relational Parametricity for Computational Effects

Møgelberg

Simpson

2007

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)

View full text Add to dashboard Cite

Abstract. According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relational parametricity, introduced by Reynolds, is one possible mathematical formulation of this idea. Relational parametricity provides a powerful tool for establishing data abstraction properties, proving equivalences of datatypes, and establishing equalities of programs. Such properties have been well studied in a pure functional setting. Many programs, however, exhibit computational effects, and are not accounted for by the standard theory of relational parametricity. In this paper, we develop a foundational framework for extending the notion of relational parametricity to programming languages with effects.

show abstract

Section: A Polymorphic Calculusmentioning

confidence: 97%

Section: Introductionmentioning

confidence: 97%

See 1 more Smart Citation

Relational Parametricity for Computational Effects

Møgelberg

Simpson

2007

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)

View full text Add to dashboard Cite

show abstract

“…Other languages aim to bring effects into their type system, such as Disciple [17], Frank 2 and Koka 3 . These languages are built on well-studied theoretical foundations [13,15,26,27], which we have also applied in this paper. Algebraic effects can also be used in Haskell [29], though in a less powerful way than described here.…”

Section: Related Workmentioning

confidence: 99%

Programming and reasoning with algebraic effects and dependent types

Brady

2013

Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming

View full text Add to dashboard Cite

One often cited benefit of pure functional programming is that pure code is easier to test and reason about, both formally and informally. However, real programs have side-effects including state management, exceptions and interactions with the outside world. Haskell solves this problem using monads to capture details of possibly side-effecting computations -it provides monads for capturing State, I/O, exceptions, non-determinism, libraries for practical purposes such as CGI and parsing, and many others, as well as monad transformers for combining multiple effects.Unfortunately, useful as monads are, they do not compose very well. Monad transformers can quickly become unwieldy when there are lots of effects to manage, leading to a temptation in larger programs to combine everything into one coarse-grained state and exception monad. In this paper I describe an alternative approach based on handling algebraic effects, implemented in the IDRIS programming language. I show how to describe side effecting computations, how to write programs which compose multiple fine-grained effects, and how, using dependent types, we can use this approach to reason about states in effectful programs.

show abstract

“…A number of attacks have been made on the problem: Stark's thesis [25,24], which deals with dynamic allocation but not pointers, and Ghica's and Levy's theses [4,5,7,8], which address the general semantic structure but not data representation reasoning. The recent paper of Banerjee and Naumann [2] is the first to address data representation correctness with heap variables and pointers.…”

Section: Introductionmentioning

confidence: 99%

Correctness of Data Representations Involving Heap Data Structures

Reddy¹,

Yang²

2003

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. While the semantics of local variables in programming languages is by now well-understood, the semantics of pointer-addressed heap variables is still an outstanding issue. In particular, the commonly assumed relational reasoning principles for data representations have not been validated in a semantic model of heap variables. In this paper, we define a parametricity semantics for a Pascal-like language with pointers and heap variables which gives such reasoning principles. It is found that the correspondences between data representations are not simply relations between states, but more intricate correspondences that also need to keep track of visible locations whose pointers can be stored and leaked.

show abstract

Call-By-Push-Value

Cited by 48 publications

References 50 publications

Relational Parametricity for Computational Effects

Relational Parametricity for Computational Effects

Programming and reasoning with algebraic effects and dependent types

Correctness of Data Representations Involving Heap Data Structures

Contact Info

Product

Resources

About