J. Launchbury and S. L. Peyton Jones. State in Haskell. LISP and Symbolic Computation, 8(4):293--341, Dec. 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Programmable Type Systems for Domain Specific Languages - Thiemann (2002) (3 citations) (Correct)
....see the terms and conditions, again) Certainly, a puzzling situation. The good news is that we can tackle this programming error with the type system, as well. Our solution relies on the use of a rank 2 type. It is inspired by Launchbury and Peyton Jones s solution to the problem of local state [12]. The trick is to index the underlying CGI monad with a phantom type variable. This phantom type variable also appears (as an extra type parameter) in the type of the input handles. The creation of an input widget has the following revised typing textInputField : HTMLField x (InputField String x ....
J. Launchbury and S. L. Peyton Jones. State in Haskell. Lisp and Symbolic Computation, 8(4):293-341, Dec. 1995.
Scrap Your Boilerplate: A Practical Design Pattern for Generic .. - Lämmel, Jones (2003) Self-citation (Jones) (Correct)
No context found.
J. Launchbury and S. Peyton Jones. State in Haskell. Lisp and Symbolic Computation, 8(4):293--342, Dec. 1995.
Scrap Your Boilerplate: A Practical Design Pattern for Generic .. - Lämmel, Jones (2003) Self-citation (Jones) (Correct)
No context found.
J. Launchbury and S. Peyton Jones. State in Haskell. Lisp and Symbolic Computation, 8(4):293--342, Dec. 1995.
Engineering Parallel Symbolic Programs in GpH - Loidl, Trinder, Hammond.. (1999) (5 citations) Self-citation (Jones) (Correct)
No context found.
J. Launchbury and S.L. Peyton Jones. State in Haskell. Lisp and Symbolic Computation, 8(4):293-342, December 1995. URL: http://research.microsoft.com/Users/simonpj/Papers/state-lasc.ps.gz.
Controlling Effects - Filinski (1996) (2 citations) Self-citation (Reynolds) (Correct)
No context found.
John C. Reynolds. The discoveries of continuations. Lisp and Symbolic Computation, 6(3/4):233--247, November 1993.
Scrap Your Boilerplate: A Practical Design Pattern for Generic .. - Lämmel, Jones (2003) Self-citation (Jones) (Correct)
No context found.
J. Launchbury and S. Peyton Jones. State in Haskell. Lisp and Symbolic Computation, 8(4):293--342, Dec. 1995.
Value Recursion in Monadic Computations - Erkok (2002) (2 citations) Self-citation (Launchbury) (Correct)
....of value recursion on the list monad, providing practical evidence for the definition given by Equation 4.4 being preferable over those given by Equation 4.13. 4. 4 State State monads capture the notion of computations that depend on modifiable stores, providing safe access to imperative features [51, 52]. A typical state monad, manipulating an internal state with type # , has the following structure [7, 91] type ST # # = # return x = #s. x , s) g = #s. let (a , s # ) f s in g a s # 43 The corresponding value recursion operator is given by: ST # #) ST # # mfix # f = #s. let (a ....
....[71] can be used as a basis for such a work, although it is not immediately clear how to accommodate for references and input output operations. Similarly, Launchbury and Peyton Jones discuss parametricity of constants for manipulating references in the context of the state monad of Haskell [52], but their results are not directly applicable in our framework due to differences in the notion of reference variables, handling of the heap, and the additional complexity introduced by input output. Examples In this chapter, we will consider a number of practical programming examples, ....
[Article contains additional citation context not shown here]
Launchbury, J., and Peyton Jones, S. L. State in Haskell. Lisp and Symbolic Computation 8, 4 (Dec. 1995), 293--341. (42, 121, 128)
Semantics of fixIO - Erkök, Launchbury, Moran (2001) Self-citation (Launchbury) (Correct)
....rather mysterious function called fixIO was also introduced. Intuitively, fixIO allows us to model computations that depend on results that are not yet computed but lazily available [1, section 4. 1] The functionality provided by fixIO is similar to that of fixST associated with the state monad [7]. Later work on recursion resulting from the values of monadic actions tried to explain the behavior of such fixed point operators from an axiomatic point of view [3] It was noted that a generic fixed point operator, one that would work regardless of the underlying e#ect, was not available. ....
Launchbury, J., and Peyton Jones, S. L. State in Haskell. Lisp and Symbolic Computation 8, 4 (Dec. 1995), 293--341.
From System F to Typed Assembly Language - Greg Morrisett David (1998) (6 citations) (Correct)
No context found.
J. Launchbury and S. L. Peyton Jones. State in Haskell. LISP and Symbolic Computation, 8(4):293--341, Dec. 1995.
A Monadic Approach for Avoiding Code Duplication when .. - Swadi, Taha.. (2006) (Correct)
No context found.
J. Launchbury and S. L. Peyton Jones. State in Haskell. LISP and Symbolic Computation, 8(4):293--342, 1995.
Linear Regions Are All You Need - Fluet, Morrisett, Ahmed (Correct)
No context found.
Launchbury, J., Peyton Jones, S.: State in Haskell. Lisp and Symbolic Computation 8(4) (1995) 293--341
A Programming Language for Probabilistic Computation - Park (2005) (Correct)
No context found.
J. Launchbury and S. L. Peyton Jones. State in Haskell. Lisp and Symbolic Computation, 8(4):293-- 341, Dec. 1995.
ML-like Inference for Classifiers - Calcagno, Moggi, Taha (2004) (5 citations) (Correct)
No context found.
John Launchbury and Simon L. Peyton Jones. State in haskell. LISP and Symbolic Computation, 8(4):293-342, 1995. pldi94.
Staging Dynamic Programming Algorithms - Kedar Swadi Kswadi (2005) (Correct)
No context found.
John Launchbury and Simon L. Peyton Jones. State in haskell. LISP and Symbolic Computation, 8(4):293-- 342, 1995. pldi94.
Meta-Programming through Typeful Code Representation - Chen, Xi (2003) (4 citations) (Correct)
No context found.
J. Launchbury and S. Peyton-Jones. State in Haskell. Lisp and Symbolic Computation, pages 293--342, 1995.
From System F to Typed Assembly Language - Greg Morrisett David (1998) (6 citations) (Correct)
No context found.
J. Launchbury and S. L. Peyton Jones. State in Haskell. LISP and Symbolic Computation, 8(4):293--341, Dec. 1995.
Typed Memory Management in a Calculus of Capabilities - Walker, Crary, Morrisett (2000) (Correct)
No context found.
John Launchbury and Simon L. Peyton Jones. State in Haskell. LISP and Symbolic Computation, 8(4):293--341, December 1995. 54
ML-like Inference for Classifiers - Calcagno, Moggi, Taha (2004) (5 citations) (Correct)
No context found.
John Launchbury and Simon L. Peyton Jones. State in haskell. LISP and Symbolic Computation, 8(4):293--342, 1995.
st Year Transfer Dissertation - Joel Wright Foundations (Correct)
No context found.
John Launchbury and Simon L. Peyton Jones. State in haskell. Lisp and Symbolic Computation, 8(4):293--341, 1995.
Controlling Effects - Filinski (1996) (2 citations) (Correct)
No context found.
John Launchbury and Simon L. Peyton Jones. State in Haskell. Lisp and Symbolic Computation, 8(4):293--341, December 1995.
A Modal Language for Effects - Park, Harper (2004) (Correct)
No context found.
J. Launchbury and S. L. Peyton Jones. State in Haskell. Lisp and Symbolic Computation, 8(4):293--341, Dec. 1995.
Names and Higher-Order Functions - Stark (1995) (29 citations) (Correct)
No context found.
J. Launchbury and S. L. Peyton Jones. State in Haskell. Lisp and Symbolic Computation, 1995. To appear. (pp. 123, 125)
Traced Premonoidal Categories - Benton, Hyland (1999) (3 citations) (Correct)
No context found.
J. Launchbury and S. L. Peyton Jones. State in Haskell. Lisp and Symbolic Computation, 8(4):293--341, 1995.
Categorical Structure of Continuation Passing Style - Thielecke (1997) (18 citations) (Correct)
No context found.
John C. Reynolds. The discoveries of continuations. Lisp and Symbolic Computation, 6(3/4):233--247, November 1993.
On the call-by-value CPS transform and its semantics - Führmann, Thielecke (2003) (3 citations) (Correct)
No context found.
John C. Reynolds. The discoveries of continuations. Lisp and Symbolic Computation, 6(3/4):233--247, November 1993.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC