Hudak, P., Peyton Jones, S. L., Wadler, P., et al. A Report on the Functional Language Haskell. SIGPLAN Notices, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Fully Abstract Semantics for a Higher-Order Functional Language .. - Jeffrey (1994) (1 citation) (Correct)
....and computations of values is standard in the call by value l calculus, but is usually done syntactically rather than in the type system. Computation types have had some success in the functional programming community in modelling systems with side effects (Wadler, 1990) such as the Haskell (Hudak et al. 1992) monadic I O library (Gordon et al. 1994) TCS special issue: MFPS 3 In Section 3 we present a l calculus with an explicit type constructor, and show (assuming the programs satisfy certain equivalences) that its models are precisely given by categorical structures: Programming construct ....
HUDAK, P., PEYTON JONES, S. L., WADLER, P., et al.(1992). A report on the functional language Haskell.
A Fully Abstract Semantics for a Concurrent Functional Language.. - Jeffrey (1995) (8 citations) (Correct)
....setting. Moggi has concentrated on the equational and denotational semantics for MML, for example expressing nondeterminism as powerdomain rather than operationally. The use of monads in lazy functional programming, pioneered by Wadler [31] and since used in specifying IO [6, 7] for Haskell [14] has concentrated on the algebraic properties of computation types. Providing an operational semantics for a CML like language in the form of a labelled transition system. Reppy s operational semantics for CML uses a reduction system more like Standard ML [21] than CCS. Giving a fully ....
P. Hudak, S. L. Peyton Jones, P. Wadler, et al. A report on the functional language Haskell. SIGPLAN Notices, 1992.
Designing a Programming Language for Active Networks - Wakeman, Jeffrey, Graves, Owen (1998) (9 citations) (Correct)
....and ffl control code, which can perform arbitrary computation. These categories are reflected in the type system, which can enforce the restriction that packet forwarding code cannot allocate heap (Requirement 4. 9) This separation of categories of computation is commonly used in semantics [14, 15, 16] to distinguish between expressions with no computational significance such as: 37 1 2 and those with computational significance: while (true) f g print( hello world ) get(r) This separation into categories of computation can be presented using monadic type systems where we distinguish ....
P. Hudak, S. L. Peyton Jones, P. Wadler, et al. A report on the functional language Haskell. SIGPLAN Notices, 1992.
A Survey of Semantic Techniques for Active Networks - Jeffrey, Wakeman (1997) (5 citations) (Correct)
....phase, but restrict to for loops during packet forwarding, to ensure that packet forwarding code is guaranteed to terminate. Literature. The notion of computation as type comes from Moggi [12] and was introduced to the functional programming community by Wadler [13] The Haskell language [14] uses monads to control the uses of side effects. The word category is being used formally here, since typed programming languages can be analyzed using techniques of category theory, see [15, 16] for instance. 6 Resource access Capability systems are a well established resource control ....
P. Hudak, S. L. Peyton Jones, P. Wadler, et al. A report on the functional language Haskell. SIGPLAN Notices, 1992.
A Schema for Adding Dependent Types to ML - Xi, Pfenning (Correct)
....array bound checks. There constraints are linear equalities and inequalities over integers, solved by a variant of Fourier s method. 1 Introduction Type systems for functional languages can be broadly classified into those for rich, realistic languages such as Standard ML[10] CAML[19] or Haskell[6], and those for small, pure languages such as the ones underlying Coq[2] NuPrl[1] or PX[5] Type checking and inference in realistic languages is theoretically decidable and practically feasible without requiring large amounts of type annotations. In order to achieve this, the type systems are ....
Hudak, P., Peyton Jones, S. L., Wadler, P., et al. A Report on the Functional Language Haskell. SIGPLAN Notices, 1992.
A Schema for Adding Dependent Types to ML - Xi, Pfenning (1997) (Correct)
....of the paper lies in our language design, including its elaboration and type checking rules which make the approach practical. 1 Introduction Type systems for functional languages can be broadly classified into those for rich, realistic languages such as Standard ML[10] CAML[16] or Haskell[6], and those for small, pure languages such as the ones underlying Coq [2] NuPrl[1] or PX[5] Type checking and inference in realistic languages is theoretically decidable and practically feasible without requiring large amounts of type annotations. In order to achieve this, the type systems are ....
Hudak, P., Peyton Jones, S. L., Wadler, P., et al. A Report on the Functional Language Haskell. SIGPLAN Notices, 1992.
A Schema for Adding Dependent Types to ML - Xi, Pfenning (Correct)
No context found.
Hudak, P., Peyton Jones, S. L., Wadler, P., et al. A Report on the Functional Language Haskell. SIGPLAN Notices, 1992.
A Schema for Adding Dependent Types to ML - Hongwei Xi Department (Correct)
No context found.
Hudak, P., Peyton Jones, S. L., Wadler, P., et al. A Report on the Functional Language Haskell. SIGPLAN Notices, 1992.
Data Structures for Parallel Recursion - Kornerup (1997) (2 citations) (Correct)
No context found.
Paul Hudak, Simon L. Peyton Jones, Philip Wadler, et al. A report on the functional language Haskell. SIGPLAN Notices, 1992.
Parlists - a Generalization of Powerlists - Kornerup (1997) (2 citations) (Correct)
No context found.
Paul Hudak, Simon L. Peyton Jones, Philip Wadler, et al. A report on the functional language Haskell. SIGPLAN Notices, 1992.
Towards a proposal for datatypes in E-LOTOS - Leduc, Pecheur, Garavel.. (1995) (Correct)
No context found.
P. Hudak, S. L. Peyton Jones, P. Wadler, et al. A report on the functional language Haskell. SIGPLAN Notices, 1992.
Towards a proposal for datatypes in E-LOTOS - Leduc, Pecheur, Garavel.. (1995) (Correct)
No context found.
P. Hudak, S. L. Peyton Jones, P. Wadler, et al. A report on the functional language Haskell. SIGPLAN Notices, 1992.
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