S. Peyton Jones and Hughes J. et al. Report on the programming language Haskell 98. University of Yale, 1999. http://www.haskell.org/definition/.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....description of the more advanced features, with many examples of how to use them. A section dealing with common mistakes. Why these Combinators Have you always been intrigued by combinator parsers because they allow you to: Use the abstraction, typing and naming mechanism of Haskell[27]. Create parsers on the fly, that is, at execution time of a program. Keep life simple by not having to run a separate program in order to generate a parser. To use the same formalism for describing scanners and parsers. Use the same formalism for describing semantic routines and ....

....not the case, because by currying we might call a function with less parameters and obtain a function instead. Another example of di#erences between type systems is that in a language such as C [23] or C [29] there is really no di#erence between a boolean and an integer. In Java [6] and Haskell [27] it is an error to use an integer where a boolean was expected and vice versa. Usually, people will not want a character a to be added to an integer, but C (and to be honest, Java as well) will not make note of this fact. Implicitly, it knows how to convert cast characters to integers. In this ....

Simon Peyton Jones (editor) and John Hughes (editor). Report on the Programming Language Haskell 98. A Non-strict, Purely Functional Language, 1999.

....is too restrictive. Therefore, Chameleon implements an unambiguity check which subsumes the ones found for Haskell 98 and functional dependencies [12] We refer to [21] for more details. The unambiguity condition (plus some other conditions) ensure that we can provide a well defined semantics [20] for Chameleon programs. 2.4 Context We refer to context as the set of constraints in type signatures and CHRs. There are no syntactic restrictions on contexts in Chameleon, in contrast to Haskell 98. For example, consider the invalid Haskell 98 program x : C [a] a x = undefined In ....

....of types. The logic constraint programming style provided by CHRs might not necessarily suit the taste of every functional programmer. However, one of the benefits of the CHR language is that some concise results are available which ensure decidable type inference [21] and a well defined semantics [20] for Chameleon. Compare this to Augustsson s [1] dependently typed language Cayenne which comes with great expressiveness but gives no guarantees regarding decidable type inference. We even believe that a logic language such as CHRs seems to have some advantages when designing some complex ....

S. Peyton Jones et al. Report on the programming language Haskell 98, February 1999. http://haskell.org.

....t, is a subtype of the one in 2. t, has fewer imports and more exports than 3. for each imported variable in t, its type in t is a subtype of its type in t, and 4. for each exported variable in tg, its type in t, is a subtype of its type in tg. The typing rules for UNITe are shown in Figure 15. These rules are typed extensions of the rules from Section 4.1.4. The special judgement , is used when subsumption is allowed on an expression s type. Subsumption is used carefully so that type checking is deterministic. For example, subsumption is not allowed for the e expression in the invoke ....

.... ti: xi: i export te: r; x:rg type t xchxd I 1 I :CcrXdr r t xt val z:r = d in e b : sig[i, e, b] compound import ti: K[ xi: i export t: ne Xe: e link e 1 with twl : wl Xwl :Twl provides tpl : npl Xpl :Tpl and e2 with tw2lltgw2 xw2:Tw2 provides tp2lltp2 Xp2:Tp2 : sig[i, e, b] Figure 15: Type checking for UNITe The third rule determines the signature of a unit expression. The first line of antecedents contains simple contextsensitive syntax checks as in UNITa. In the second line, all of the type expressions in the unit are checked in an environment that is extended with the ....

HUDAK, P., AND WADLER, P. (EDS.). Report on the programming language Haskell. Tech. Rep. YALE/DCS/RR777, Yale University, Department of Computer Science, Aug. 1991.

.... supported by Seam are the implementation basis for futures as supported by Alice, and as explored in a formal calculus [20] Transients can be used to express data flow synchronization, logic variables as found in logic programming languages such as Oz [26] and laziness as found in Haskell [11]. By needs are closely related to thunks as used in the implementation of lazy functional languages. 4. LANGUAGE IMPLEMENTATION A language implementor targeting Seam reuses the generic infrastructure as shown in Figure 1, by providing the components which the infrastructure parameterizes over. ....

P. Hudak, S. L. Peyton Jones, and P. Wadler. Report on the programming language Haskell. In SIGPLAN Notices, volume 27(5), May 1992.

....cc. gatech. edu yannis fc iEmail: yannis,lorgon cc.gat ech.edu Copyright ( 2000 John Wiley 85 Sons, Ltd. Received 01 January 2000 Revised 01 January 2000 Accepted 01 January 2000 2 Y. SMARAGDAKIS AND B. MCNAMARA functional operators (a large part of the Haskell Standard Prelude [8]) The library is currently quite rich in functionality and has an efficient implementation. In a previous paper [6] we introduced FC and its innovative type system, showed the components of the library, and demonstrated how its implementation is more efficient than previous similar attempts. ....

S. Peyton Jones and J. Hughes (eds.), Report on the Programming Language Haskell 98, available from www.haskell.org, February 1999.

....Every programming language comes with its standard libraries. If a new release of a programming language introduces new constructs, then it is challenging to make these libraries more useful by making use of the expressive power of those constructs. The introduction of type classes in Haskell (see [3]) has had an influence on the design of its standard prelude. The prelude contains, among others, type classes Text, Eq and Num which make it possible to overload standard function and operator notation for a variety of type class instances. Gofer is the first programming language which supports ....

P. Hudak, S. Peyton Jones, P.Wadler, Report on the programming language Haskell, version 1.2. ACM SIGPLAN Notices, Vol. 27(5), May 1992.

....and quantified types. Appel and McAllester [5] further extend this to contravariant recursive types. Our new result is an extension of all the previous type systems to mutable references, where reference cells can contain values of any type, including functions and other references. Almost [12] all practical programming languages use mutable references; object oriented languages (such as Java) and functional languages (such as ML) permit references to contain values of arbitrary (statically checked) type. Therefore, general references are essential in our plans to build PCC systems for ....

P. Hudak, S. Peyton Jones, and P. Wadler. Report on the programming language Haskell, a non-strict, purely functional language, version 1.2. SIGPLAN Notices, 27(5), May 1992.

....program in a sublanguage, with the purpose of decreasing its syntactic complexity. Desugaring is a kind of normalization in which some of the constructs (syntactic sugar) of a language are eliminated by translating them into more fundamental constructs. For example, the Haskell language definition [44] describes for many constructs how they can be desugared to a kernel language. Other examples are module flattening and the definition of EBNF constructs in pure BNF as is done for example in the SDF2 normalizer [51] Simplification is a more general kind of normalization in which a program is ....

S. Peyton Jones, J. Hughes, et al. Report of the programming language Haskell98. a non-strict, purely functional language, February 1999.

....are lost, i.e. rules are no longer independent, but tied to a particular transformation function, and the definition of transformation functions involves a considerable overhead due to the explicit definition of tree traversals. Functional Programming Functional languages such as Haskell [21] and ML [20] o#er some of the same ingredients as term rewriting systems, i.e. algebraic data types and pattern matching. In addition, higher order functions and polymorphism allow the definition of traversal schemas such as folds for specific data types. However, transformation rules cannot be ....

S. Peyton Jones, J. Hughes, et al. Report on the programming language Haskell 98, 1999. 1

....In an implementation without side e#ects, the lock synchronization can be avoided, reducing the degradation of performance. A good way to obtain a side e#ect free realization is the use of a pure functional programming language. In this paper, we focus on how the algorithm is expressed in Haskell [18] and the programming techniques required. In particular, we distinguish between the coordination level, which is responsible for the overall organization, and the computation level which performs the numeric calculations. The coordination level is expressed in Haskell, whereas the computations can ....

....programming languages for the two levels because of their di#erent natures. The coordination level involves tree sweeps, recursion, references between nodes, self referential graph structures and task control. It is well suited for a very high level programming language, and we choose Haskell 98 [18]. The numerical algorithms in the calculation level are serveed adequately by imperative languages, and implementations in C are already available for them. A full implementation of the program would use the Haskell foreign language interface [5; 16] to call the calculation functions. We have ....

S. Peyton Jones, J. Hughes, et al. Report on the programming language haskell 98. www.haskell.org, 1999.

....[Programming Languages] Languages Classifications Concurrent, distributed and parallel languages, Applicative (functional) languages General Terms Languages Keywords Parallel Functional Programming, Coordination, Haskell, Parallel SoftwareEngineering 1. INTRODUCTION Haskell[27] is a general purpose, pure functional programming language incorporating recent innovations in programming language design. It has now become de facto standard # Also at Departamento de Estatstica e Informatica, UniversidadeCat olica de Pernambuco, Recife, Brazil. Sponsored by CNPq grants ....

S. L. Peyton Jones and J. Hughes. Report on the Programming Language Haskell 98, A Non-strict, Purely Functional Language. Feb. 1999.

No context found.

S. Peyton Jones, R. Hughes, L. Augustsson, D. Barton, B. Boutel, W. Burton, J. Fasel, K. Hammond, R. Hinze, P. Hudak, T. Johnsson, M. Jones, J. Launchbury, E. Meijer, J. Peterson, A. Reid, C. Runciman, and P. Wadler. Report on the programming language Haskell 98. http:/haskell.org, Feb. 1999.

No context found.

S. Peyton Jones et al. Report on the programming language Haskell 98, February 1999. http://haskell.org.

.... is similar to Leroy s work on ML s module system [7] There have been numerous studies on advanced module systems, and the use of type theory to formalize them [4, 8] In the same spirit, there has recently been a proposal for a replacement of the Haskell module system by Shields and Peyton Jones [11]. 9 Conclusions and discussion We have provided a formal specification of the Haskell 98 module system, based on the Haskell 98 language report. The process of writing the specification was valuable as we identified a number of areas of the report, which were unclear, or underspecified, and as a ....

S. Peyton Jones (editor). Report on the programming language Haskell 98. http://research.microsoft.com/ simonpj/haskell98-revised/, March 2002. 11

....interpretation of the term can vary quite significantly from one language to the next. In some languages, the module system provides a powerful mechanism for creating, using, and reusing programming abstractions. Standard ML, for example, has one of the most powerful module systems of this kind [9]. In other languages, the main purpose of the module system is to support separate compilation, motivated by pragmatic issues that arise during the development of large programs. In yet other languages, the module system serves primarily as a mechanism for namespace management, allowing ....

S. Peyton Jones and J. Hughes (editors). Report on the programming language Haskell 98. Technical Report YALEU/DCS/RR-1106, Yale University, CS Dept., Feb. 1999.

No context found.

Peyton Jones, S., Hughes, R., Augustsson, L., Barton, D., Boutel, B., Burton, W., Fasel, J., Hammond, K., Hinze, R., Hudak, P., Johnsson, T., Jones, M., Launchbury, J., Meijer, E., Peterson, J., Reid, A., Runciman, C., and Wadler, P. (1999). Report on the programming language Haskell 98. http:/haskell.org.

No context found.

S. Peyton Jones and Hughes J. et al. Report on the programming language Haskell 98. University of Yale, 1999. http://www.haskell.org/definition/.

No context found.

S. Peyton Jones and Hughes J. et al. Report on the programming language Haskell

No context found.

S. Peyton Jones and J. Hughes et al. Report on the programming language Haskell

No context found.

S. Peyton Jones and J. Hughes et al. Report on the programming language Haskell

No context found.

S. Peyton Jones and Hughes J. et al. Report on the programming language Haskell

No context found.

S. Peyton Jones and Hughes J. et al. Report on the programming language Haskell

No context found.

S. Peyton Jones and Hughes J. et al. Report on the programming language Haskell

No context found.

S. Peyton Jones, J. Hughes et al., Report on the Programming Language Haskell 98, a Non-strict, Purely Functional Language,, Available from http://haskell.org, 1999.

No context found.

S. Peyton Jones, J. Hughes et al., Report on the Programming Language Haskell 98, a Non-strict, Purely Functional Language,, Available from http://www.haskell.org, 1999.

No context found.

S. Peyton Jones and J. Hughes (eds.), Report on the Programming Language Haskell 98, available from www.haskell.org, February 1999.

No context found.

Simon Peyton Jones and John Hughes. Report on the programming language Haskell 98. Technical report, http://www.haskell.org, 1999.

No context found.

P. Hudak, S.L. Peyton Jones and P. Wadler. Report on the Programming Language Haskell. SIGPLAN Notices, March 1992.

No context found.

S. Peyton Jones and J. Hughes, editors. Report on the Programming Language Haskell 98. http://www.haskell.org/onlinereport/, 1999.

No context found.

P. Hudak, S. Peyton Jones, P. Wadler, et al. Report on the programming language Haskell. ACM SIGPLAN Notices, 27(5), March 1992.

No context found.

P. Hudak and P. Wadler. Report on the programming language Haskell. Technical Report YALE/DOC/RR777, Yale University, Department of Computer Science, 1991.

No context found.

P. Hudak, S. Peyton Jones, P. Wadler, B. Boutel, J. Fairbairn, J. Fasel, K. Hammond, J. Hughes, Th. Johnsson, D. Kieburtz, R. Nikhil, W. Partain, J. Peterson. Report on the programming language Haskell, In ACM SigPlan Notices, 27 (5): 1--164. May 1992.

No context found.

S. Peyton Jones, J. Hughes, et al. Report of the programming language Haskell98. a non-strict, purely functional language, February 1999.

No context found.

S. Peyton Jones and J. Hughes et al. Report on the programming language Haskell

No context found.

P. Hudak, S. Peyton Jones, P. Wadler, B. Boutel, J. Fairbairn, J. Fasel, K. Hammond, J. Hughes, Th. Johnsson, D. Kieburtz, R. Nikhil, W. Partain, J. Peterson. Report on the programming language Haskell, In ACM SigPlan Notices, 27 (5): 1--164. May 1992.

No context found.

S. Peyton Jones and Hughes J. et al. Report on the programming language Haskell

No context found.

Simon Peyton Jones, John Hughes, et al. Report on the programming language Haskell 98. Available from www.haskell.org, February 1999.

No context found.

Peyton Jones, S. et al: Report on the Programming Language Haskell 98. http://www.haskell.org/ (1999-2003), also, Haskell 98 Language and Libraries, the Revised Report, Cambridge U. P. (2003)

No context found.

Hudak, P. et al: Report on the Programming Language Haskell, version 1.2. Sigplan 27(5) (1992)

No context found.

S. Peyton Jones(editor), J. Hughes(editor) et al. Report on the programming language Haskell 98, Yale, 1999. http://www.haskell.org/definition/

No context found.

P. Hudak et al. Report on the programming language Haskell. SIGPLAN Notices, 27(5):Section R, 1992. (p 97)

No context found.

P. Hudak, P. Wadler, Arvind, B. Boutel, J. Fairbairn, J. Fasel, K. Hammond, J. Hughs, T. Johnsson, D. Kieburtz, R. Nikhil, S.P. Jones, M. Reeve, D. Wise, and J. Young. Report on the Programming Language Haskell. Technical Report RR 777, Yale University, April 1990.

No context found.

S. L. Peyton Jones, J. Hughes, et al. Report on the Programming Language Haskell 98, 1999. http://haskell.org/ onlinereport.

No context found.

Hudak, P., and al. Report on the programming language Haskell. SIGPLAN Notices, volume 27(5), section R. ACM Press, 1992.

No context found.

S. Peyton Jones et al. Report on the programming language Haskell 98, a non-strict, purely functional language. Available from http://haskell.org, February 1999.

No context found.

S. Peyton Jones, J. Hughes, (editors), L. Augustsson, D. Barton, B. Boutel, W. Burton, J. Fasel, K. Hammond, R. Hinze, P. Hudak, T. Johnsson, M. Jones, J. Launchbury, E. Meijer, J. Peterson, A. Reid, C. Runciman, and P. Wadler. Report on the Programming Language Haskell 98, a Nonstrict, Purely Functional Language. Available from http://haskell.org, February 1999.

No context found.

S. Peyton Jones, J. Hughes, (editors), L. Augustsson, D. Barton, B. Boutel, W. Burton, J. Fasel, K. Hammond, R. Hinze, P. Hudak, T. Johnsson, M. Jones, J. Launchbury, E. Meijer, J. Peterson, A. Reid, C. Runciman, and P. Wadler. Report on the Programming Language Haskell 98, a Non-strict, Purely Functional Language. Available from http://haskell.org, February 1999.

No context found.

Simon Peyton Jones et al. Report on the programming language haskell 98. Technical report, URL: www.haskell.org/definition/, February 1999.

No context found.

Simon Peyton Jones and John Hughes. Report on the programming language Haskell 98. Downloadable from www.haskell.org, February 1999.

No context found.

Hudak, P. et al. Report on the Programming Language Haskell, 1990.

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