P. Hudak, S. Peyton Jones, P. Wadler, Arvind, B. Bontel, J. Fairbairn, J. Fasel, M. Guzman, K. Hammond, J. Hughs, T. Johnson, R. Kieburtz, W. Partain, and J. Peterson. Report on the Functional Programming Language Haskell (version 1.2). ACM SIGPLAN Notices, 27(5), July 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....application like true true . Such operations are either unsafe or require run time coercions. Many functional programming languages use type systems which are related to System F. The designers of many strongly typed functional programming languages (e.g. ML [MTH90] Miranda [Tur85] Haskell [HW88]) have chosen to use the Hindley Milner type system whose core coincides with a fragment of F. There are also various programming languages using type systems based on variations of F (e.g. Quest [Car91] and LEAP [PL89] The choice to use a type system similar to F or some portion of F in ....

P. Hudak and P. L. Wadler. Report on the functional programming language Haskell. Technical Report YALEU/DCS/RR656, Yale University, 1988.

....not evaluated until needed. This permits structures that contain elements which, if evaluated, would lead to an error or fail to terminate [HPF99] Since there are a number of overheads in the implementation of this feature (see [Pey87] lazy functional languages like Gofer [Jon92] and Haskell [HPW92] allow for syntactic annotations on the arguments of datatype constructors, thus allowing an immediate evaluation. Example 4 The following definition in Haskell: data List a = Nil Cons a (List a) declares a (polymorphic) type List a whose binary data constructor Cons evaluates the first ....

P. Hudak, S.J. Peyton-Jones, and P. Wadler. Report on the Functional Programming Language Haskell: a non--strict, purely functional language. Sigplan Notices, 27(5), 1992.

....without a ecting the observable outcome of the program. A good understanding of operational equivalence can facilitate modular development of programs and make it possible to prove the soundness of various optimizations. It is therefore an advantage of a purely functional language, such as Haskell [13], that it supports some well understood principles for reasoning about operational equivalence. Purely functional languages, however, lack features that make it possible to write more ecient programs. For this reason, many functional languages, e.g. Standard ML [22] and Scheme [5] include ....

....design philosophy in separating the terms that can modify the state from those that may not. The lazy functional programming community has also been active in searching for new, clean ways of adding state to programming languages; just a few of these e orts are dialogue based I O in Haskell [13], monads [29, 43] continuation based mutable abstract datatypes [12] and lazy functional state threads [18] whose type theoretic encapsulation of state is remarkably similar to the work in semantics of [27] In each case, the design preserves some functional character of the language the ....

P. Hudak, S. L. Peyton Jones, P. L. Wadler, Arvind, B. Boutel, J. Fairbairn, J. Fasel, M. Guzman, K. Hammond, J. Hughes, T. Johnsson, R. Kieburtz, R. S. Nikhil, W. Partain, and J. Peterson. Report on the functional programming language Haskell, Version 1.2. ACM SIGPLAN Notices, May 1992.

....this extension looks particularly simple, since it does not appear at the term level at all, following the philosophy that types are compile time constraints, and are not used in the actual computation. This reflects current practice in languages such as ML [MTH90] Miranda [Tur85] and Haskell [HW88]. The syntax of formulas is extended with propositional variables ff, fi, fl and the universal quantifier 8ff:A. The system ILL (i.e. the sequent formulation of Linear Logic as given in Section 3) is extended to its second order version ILL 2 by the rules Gamma 8ff:A Gamma; A[B=ff] ....

P. Hudak and P. Wadler. Report on the functional programming language Haskell. Technical Report YALEU/DCS/RR666, Department of Computer Science, Yale University, November 1988.

....it to the realm of mere syntax, without the backing of a proper semantic theory, so that one cannot know in advance whether or not some proposed feature might work. Discussions about overloading are difficult, and sometimes even acrimonious, for languages as diverse as Ada [13] and Haskell [44], precisely because of the lack of an underlying semantic basis for these discussions. We also wish to mention that requiring signatures to be coherent allows a very simple and flexible treatment of equality, since we can always assume that t and t 0 have the same sort whenever they appear in ....

Paul Hudak, Philip Wadler, Arvind, et al. Report on the functional programming language Haskell. Technical Report YALEU/DCS/RR-666, Computer Science Department, Yale University, December 1988. Draft Proposed Standard.

.... TLC and TLC = The simply typed calculus [Chu41] TLC for short) is a very basic functional framework built around the concepts of abstraction and function application, and it forms the backbone of most modern functional programming languages (e.g. ML [G78, Mil85] Miranda [Tur85] and Haskell [HW88]) Let us briefly review its definition (cf. Bar84, HS86] The syntax of TLC types is given by the grammar T j t j (T T ) where t ranges over a set of type variables. Thus, ff is a type, as are (ff fi) and (ff (ff ff) As usual, the type ff fi fl stands for ff (fi fl) The ....

P. Hudak and P. Wadler, editors. Report on the Functional Programming Language Haskell. Technical Report YALEU/DCS/RR656, Dept. of Computer Science, Yale University, 1988.

....considerably. This has demonstrated that functional logic languages can be ef ciently implemented in a very similar way to (pure) functional or (pure) logic languages. Curry is a functional logic programming language that combines the best ideas of existing declarative languages such as Haskell [6] and SML [9] functional languages) G odel [5] and Prolog [10] logic languages) and ALF [7] Babel [8] and TOY [3] functional logic languages) in an elegant, practical, comprehensive, and seamless way. More speci cally, Curry includes higher order features, a type system, a module system, ....

....are shown as they are found, showing the substitution (if any) the computed expression (if any) and the time spent (in ms) to compute each solution. Here are some of the functional like goals which are accepted and evaluated by the interpreter for the program lists.curry. append [1,2,3,4,5] [6,7,8,9,0] Solution: 1,2,3,4,5,6,7,8,9,0] 0 ms rev [1,2,3,4,5,6,7,8,9,0] Solution: 0,9,8,7,6,5,4,3,2,1] 140 ms member 1 [1,2,3,4,5,6,7,8,9,0] Solution: True ] 40 ms Due to the functional logic semantics included in UPV Curry, you can also evaluate expressions containing ocurrences of free ....

[Article contains additional citation context not shown here]

P. Hudak, S. Peyton-Jones, and P. Wadler. Report on the Functional Programming Language Haskell: a non{strict, purely functional language. Sigplan Notices, 27(5), 1992.

....providing the facilities for visualizing frame structures. Then, the low level communication facilities (i.e. Message Handlers cf. 1] have to be integrated, providing the functionality for an efficient message exchange between frames. 1. 3 Notation For the formal text, the language Haskell [4] has been used. The definitions given in this document have been compiled using the Glorious Glasgow Haskell Compiler (ghc) Version 0.10. The example runs shown in Section 6 have been produced by the executable generated through this compilation. Text using the following notation 1 1 ugh = ....

Hudak, P., Peyton-Jones, S.L., Wadler, P., Boutel, B., Fairbairn, J., Fasel, J., Guzman, M.G., Hammond, K., Hughes, J., Johnsson,T., Kieburtz, D., Nikhil, R., Partain, W., Peterson, J. Report on the functional programming language Haskell, Version 1.2. SIGPLAN Notices 27. May 1992.

....motivated by a critic, to re ne this guess, so that a larger class of coinductive problems can be automatically veri ed. The implementation of this strategy has focused on the use of coinduction to prove the equivalence of programs in a small lazy functional language which is similar to Haskell [22]. We have developed a proof plan for coinduction and a critic associated with this proof plan. These have been implemented in CoCL A M , an extended version of CL A M [9] with encouraging results. The planner has been successfully tested on a number of theorems. 1. Introduction Proof ....

P. Hudak, S. Peyton{Jones, P. Wadler and et al., Report on the functional programming language Haskell: A non{strict, purely functional language version 1.2., in: ACM SIGPLAN Notices 27 (5), 1992.

.... is currently in the state of a theoretical concept with a precise mathematical specification (including a frame definition language) The fundamental viability of mobile frames has been verified by an abstract implementation of the model and its language using the functional language Haskell [3]. The complete model also provides extended support for the flexible visualization of arbitrary frame structures, based on the concepts of Facettes, Display Methods, and Viewers. A major drawback of the work presented in this paper is the lack of actual experiments with the behavior of ....

Hudak, P., Peyton-Jones, S.L., Wadler, P., Boutel, B., Fairbairn, J., Fasel, J., Guzman, M.G., Hammond, K., Hughes, J., Johnsson, T., Kieburtz, D., Nikhil, R., Partain, W., Peterson, J. Report on the functional programming language Haskell, Version 1.2. SIGPLAN Notices 27. May 1992.

....are required to prevent textual line breaks from being treated as logical end of statement delimiters. In Icon [12] a line break sometimes serves as a statement delimiter; but only if the last token before the line break and the first token after it are not part of the same construct. In Haskell [17] indentation can be used to indicate nesting, in place of explicit bracketing tokens, thereby making some line breaks, white space, and column positions significant. In make [9] commands must be indented by at least one tab character (and not by the visually indistinguishable sequence of blank ....

Paul Hudak and Philip Wadler. Report on the Functional Programming Language Haskell, 1990.

....new flexibility and power to both the visual interface and the dataflow process network model. In this thesis, I will use Haskell as the high level language; Haskell is a modern functional language that provides a common ground for research into functional languages and functional programming [44]. The visual language is Visual Haskell, a visual equivalent for Haskell of my own design. In the next two sections I summarise the arguments in favour of adding this third dimension. A further two sections provide an outline of following chapters, and review previously published papers and ....

.... inherit from each other to form a hierarchy. For example, the class of ordered types Ord inherits from the class of equable types Eq: class Eq a = Ord a where ( a a Bool . The standard prelude implements a full hierarchy of primitive and numeric types see [44] for details. 2.3 Evaluation mechanisms Implementations of lazy functional languages are often based on graph reduction. This section briefly reviews graph reduction and other topics related to evaluation of functional programs. The aim here is to place into context the suggested implementation ....

[Article contains additional citation context not shown here]

Paul Hudak et al. Report on the functional programming language Haskell, a nonstrict purely-functional language, version 1.2. SIGPLAN Notices, May 1992.

....new flexibility and power to both the visual interface and the dataflow process network model. In this thesis, I will use Haskell as the high level language; Haskell is a modern functional language that provides a common ground for research into functional languages and functional programming [44]. The visual language is Visual Haskell, a visual equivalent for Haskell of my own design. In the next two sections I summarise the arguments in favour of adding this third dimension. A further two sections provide an outline of following chapters, and review previously published papers and ....

.... inherit from each other to form a hierarchy. For example, the class of ordered types Ord inherits from the class of equable types Eq: class Eq a = Ord a where ( a a Bool . The standard prelude implements a full hierarchy of primitive and numeric types see [44] for details. CHAPTER 2. BACKGROUND MATERIAL 27 2.3 Evaluation mechanisms Implementations of lazy functional languages are often based on graph reduction. This section briefly reviews graph reduction and other topics related to evaluation of functional programs. The aim here is to place into ....

[Article contains additional citation context not shown here]

Paul Hudak et al. Report on the functional programming language Haskell, a nonstrict purely-functional language, version 1.2. SIGPLAN Notices, May 1992.

.... functional languages are set abstractions [26, 27, 112, 117, 118] or logical arrays [72] 1 Using these clauses for equality we can prove that the term append( 1,2] 3] is equal to [1,2,3] Note that this method of defining functions is the same as in modern functional languages like Haskell [67], Miranda [127] or ML [63] where functions are defined by argument patterns. We can also define functions by conditional equations where we may use arbitrary predicates in the conditions. For instance, the maximum function on naturals can be defined by the following conditional equations: ....

....of the operational semantics but may increase the number of nondeterministic computations steps. 2.3 Lazy Narrowing Strategies The narrowing strategies discussed so far correspond to eager evaluation strategies in functional programming. But many modern functional languages like Haskell [67] or Miranda [127] are based on lazy evaluation principles (see [68] for a discussion 13 on the advantages of lazy evaluation) A lazy strategy delays the evaluation of function arguments until their values are definitely needed to compute the result of the function call. Hence lazy evaluation ....

P. Hudak and P. Wadler. Report on the Functional Programming Language Haskell. SIGPLAN Notices, Vol. 27, No. 5, 1992.

....accompanying graduate courses on computer architecture, to rapidly prototype and study various programming and (abstract) machine models, compilation schemes, type checkers, etc. 1 Introduction Functional or function based programming languages such as Miranda, standard ML, Haskell or Scheme [Turn86, HaMiTo88, HuWa88, AbSus85] have become increasingly popular in teaching basic programming concepts at the undergraduate level as well as advanced topics such as compiler construction, type systems, abstract machines language interpreters etc. in graduate CS courses. The functional paradigm derives its appeal primarily ....

....( #2 ( #1 #0 #2 ) 6 . 4 Pattern Matching Pattern matching is an operation which extracts (sub ) structures of particular shapes and elements from given structural contexts and substitutes them for place holders in other structural contexts. It is available in all modern functional languages [Turn86, Lavi87, HuWa88] and primarily used as an elegant way 6 Note that in order to get deBruijn indices as originally defined, these indices have to be incremented by one. of defining functions as ordered sets of alternative equations. However, its full potential lies in complex rule based modifications of ....

Hudak, P.; Wadler, P. (Editors) et al.: Report on the Functional Programming Language : Haskell, Draft Proposed Standard, December 1988, Yale University

....sequence is sum ( 3, 11, 4, 3, 7 ] which would produce the result 14. 4.2.4 The apply to each construct The apply to each construct is used to apply any function, built in or user defined, over the elements of a sequence. It is similar to list comprehensions in Miranda [22] and Haskell [15]. This construct has the following structure expression : id1 in seq1; id2 in seq2; condition The syntax is based on standard set notation. It should be read as for each value in the sequences, seq1, seq2, bind the identifiers, id1, id2, to them, evaluate the expression for ....

P. Hudak and P. Wadler. Report on the functional programming language HASKELL. Technical report, Yale University, 1990.

....expressible with parametric polymorphism alone; no special subtyping conventions are needed. This technique allows the reuse of the top part of the program graph in all cases where object oriented methods allow it. Objects, classes, self reference and subtyping are expressed in terms of Haskell [11], a polymorphic, higher order functional language. This gives us a transformational semantics of these concepts. Such a semantics is useful because the semantics of Haskell itself is well understood, it can for example be expressed as a mapping into the lambda calculus, and Haskell lends ....

Hudak P. and Wadler P. (editors), Report on the functional programming language Haskell, Technical Report YALEU/DCS/RR666, Yale University, 1988.

....A Functional Programming Language A functional programming language is used to describe the sequence morphisms in this paper. The language will not be given a precise semantics, but is intended to hold no surprises for the reader familiar with the class of programming languages including Haskell [8] and that described in [2] Briefly, the following features are assumed to be part of the language, the reader is directed to [12] and [6] for more details. An expression is either an identifier, a constant, an (infix) application, a function, an if expression, a let expression, a ....

Hudak, P. et. al. (1992) "Report on the Functional Programming Language Haskell, Version 1.2" SIGPLAN Notices 27.

....parts of the actual Prolog language limited these efforts. Specification methods have stressed the algebraic approach(Liskov and Guttag 1986) and tools were developed (Guttag, Horning, and Wing 1985) but not widely used. We propose here to use the language Gofer (Jones 1991) similar to Haskell (Hudak et al. 1992; Peterson et al. 1996) It is a functional programming language with classes. It provides an advanced framework for object oriented algebraic specification. The language is strict without side effects and code is therefore referentially transparent. Gofer has a novel class system with multiple ....

Hudak, P., et al. 1992. Report on the functional programming language Haskell, Version 1.2. SIGPLAN Notices 27.

No context found.

P. Hudak, S. Peyton Jones, P. Wadler, Arvind, B. Bontel, J. Fairbairn, J. Fasel, M. Guzman, K. Hammond, J. Hughs, T. Johnson, R. Kieburtz, W. Partain, and J. Peterson. Report on the Functional Programming Language Haskell (version 1.2). ACM SIGPLAN Notices, 27(5), July 1992.

No context found.

P. Hudak. Report on the functional programming language Haskell. Draft Proposed Standard, 1988.

No context found.

P. Hudak, P.Wadler, Arvind, B. Boutel, J. Fairbairn, J. Fasel, J. Hughes, T. Johnsson, D. Kieburtz, S. P. Jones, R. Nikhil, M. Reeve, D. Wise, and 104 J. Young. Report on the Functional Programming Language Haskell. Technical report, Yale University, December 1988. Technical Report DCS/RR-666.

No context found.

P. Hudak, P. Wadler, B. Boutel, J. Fairbairn, J. Fasel, M. Guzman, K. Hammond, J. Hughes, T. Johnsson, R. Kieburtz, R. Nikhil, W. Partain, and J. Peterson. A Report on the Functional Programming language Haskell, Version 1.2. ACM SIGPLAN Notices 27(5), 1992.

No context found.

P. Hudak, P. L. Wadeler, Arvind, B. Boutel, J. Fairbairn, J. Fasel, K. Hammond, J. Hughes, T. Johnsson, R. Kieburtz, R. S. Nikhil, S. L. Peyton Jones, M.Reeve, D. Wise and J. Young, Report on the Functional Programming Language Haskell, Technical report, Department of Computer Science, Glasgow University, 1990. 73

No context found.

P. Hudak, S. L. Peyton Jones, P. Wadler, et al. Report on the functional programming language haskell. ACM SIGPLAN Notices, 27(5), May 1992. Version 1.2.

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