Lazy functional state threads

Launchbury, John; Jones, Simon L. Peyton

doi:10.1145/178243.178246

Cited by 149 publications

(74 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The inner quantification ensures that the rate information cannot escape, and that multiple series of differing lengths can never have the same rate variable. This is much like the use of a rank-2 type to encapsulate state in the runST function of the ST monad [14].…”

Section: Running Series Expressionsmentioning

confidence: 99%

Data flow fusion with series expressions in Haskell

Lippmeier

Chakravarty

Keller

et al. 2013

Proceedings of the 2013 ACM SIGPLAN Symposium on Haskell

View full text Add to dashboard Cite

Existing approaches to array fusion can deal with straight-line producer consumer pipelines, but cannot fuse branching data flows where a generated array is consumed by several different consumers. Branching data flows are common and natural to write, but a lack of fusion leads to the creation of an intermediate array at every branch point. We present a new array fusion system that handles branches, based on Waters's series expression framework, but extended to work in a functional setting. Our system also solves a related problem in stream fusion, namely the introduction of duplicate loop counters. We demonstrate speedup over existing fusion systems for several key examples.

show abstract

Section: Running Series Expressionsmentioning

confidence: 99%

Data flow fusion with series expressions in Haskell

Lippmeier

Chakravarty

Keller

et al. 2013

Proceedings of the 2013 ACM SIGPLAN Symposium on Haskell

View full text Add to dashboard Cite

show abstract

“…The work presented in this paper is mainly inspired by recent research on effect inference [6,10,11,23,24], efficient implementation of first-class continuations [2,8,22,1], monads and modular interpreters [30,12,29,13], typed intermediate languages [7,26,20,17,16,3], and foreign function call interface [9,18]. In the following, we briefly explain the relationship of these work with our resource-based approach.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

“…-Monads and modular interpreters. The idea of using resources and effects to characterize the run-time configuration of a function is inspired by recent work on monad-based interactions and modular interpreters [30,12,29,13]. Unlike in the monadic approach, our system provides a way of switching the runtime context "horizontally" from one to another via the u s G…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Type-Directed Continuation Allocation

Shao¹,

Trifonov²

2005

View full text Add to dashboard Cite

show abstract

“…Although we do not present the semantics in terms of monads, the idea to use both resources and effects to describe a function's interoperability was inspired by recent work on monad-based interactions and modular interpreters [21,9,20,10], and Wadler's work on the relationship between monads and effects [22]. Monads, viewed as compositions of basic monad transformers [10], can be used to represent sets of resources.…”

Section: Related Workmentioning

confidence: 99%

Safe and Principled Language Interoperation

Trifonov

Shao

2002

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Safety of interoperation of program fragments written in different safe languages may fail when the languages have different systems of computational effects: an exception raised by an ML function may have no valid semantic interpretation in the context of a Safe-C caller. Sandboxing costs performance and still may violate the semantics if effects are not taken into account. We show that effect annotations alone are insufficient to guarantee safety, and we present a type system with bounded effect polymorphism designed to verify the compatibility of abstract resources required by the computational models of the interoperating languages. The type system ensures single address space interoperability of statically typed languages with effect mechanisms built of modules for control and state. It is shown sound for safety with respect to the semantics of a language with constructs for selection, simulation, and blocking of resources, targeted as an intermediate language for optimization of resource handling.

show abstract

Lazy functional state threads

Cited by 149 publications

References 8 publications

Data flow fusion with series expressions in Haskell

Data flow fusion with series expressions in Haskell

Type-Directed Continuation Allocation

Safe and Principled Language Interoperation

Contact Info

Product

Resources

About