J.H. Fasel, P. Hudak, S. Peyton Jones, and P. Wadler. Sigplan Notices Special Issue on the Functional Programming Language Haskell. ACM SIGPLAN notices, 27(5), 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Bottom-Up Grammar Analysis - A Functional Formulation - - Jeuring, Swierstra (1994) (3 citations) (Correct)
....apply are familiar laws for, for example, list comprehensions [11] and maps [1, 7] Sufficient conditions for guaranteeing the existence of a fixed point solution emerge as a byproduct of this derivation. Finally we give the implementation of the derived algorithm in the functional language Gofer [5, 3]. Incorporating the functions for solving grammar analysis problems in parser generators such as a functional version of Yacc [10] and Ratatosk [8] would reduce the amount of code used in, and very likely increase the speed of, these parser generators. This paper is organised as follows. Section 2 ....
J.H. Fasel, P. Hudak, S. Peyton Jones, and P. Wadler. Sigplan Notices Special Issue on the Functional Programming Language Haskell. ACM SIGPLAN notices, 27(5), 1992.
Bottom-up Grammar Analysis - A Functional Formulation - Jeuring, Swierstra (1994) (3 citations) (Correct)
....apply are familiar laws for, for example, list comprehensions [11] and maps [1, 7] Sufficient conditions for guaranteeing the existence of a fixed point solution emerge as a byproduct of this derivation. Finally we give the implementation of the derived algorithm in the functional language Gofer [5, 3]. Incorporating the functions for solving grammar analysis problems in parser generators such as a functional version of Yacc [10] and Ratatosk [8] would reduce the amount of code used in, and very likely increase the speed of, these parser generators. This paper is organised as follows. ....
J.H. Fasel, P. Hudak, S. Peyton Jones, and P. Wadler. Sigplan Notices Special Issue on the Functional Programming Language Haskell. ACM SIGPLAN notices, 27(5), 1992.
Bottom-up Grammar Analysis - A Functional Formulation - Jeuring, Swierstra (1994) (3 citations) (Correct)
....point solution emerge as a byproduct of this derivation. An important advantage of a derivation of a program is that it is clear why and where conditions are imposed upon the components of the program. Finally we give the implementation of the derived algorithm in the functional language Gofer [7, 3]. Incorporating the functions for solving grammar analysis problems in parser generators such as a functional version of Yacc [12] Ratatosk [10] and Happy [4] would reduce the amount of code used in these parser generators. This paper is organised as follows. Section 2 defines the datatypes that ....
J.H. Fasel, P. Hudak, S. Peyton Jones, and P. Wadler. Sigplan Notices Special Issue on the Functional Programming Language Haskell. ACM SIGPLAN notices, 27(5), 1992.
Polytypic Programming - Jeuring, Jansson (1996) (51 citations) (Correct)
....For confluent and normalising term rewriting systems, the relation , which rewrites a term to its normal form, is a function. For example Succ (Succ Zero) Succ (Succ Zero) Succ (Succ (Succ (Succ Zero) We want to implement function in a functional language such as Haskell [8], that is, we want to define a function rewrite that takes a list of rewrite rules and a term, and reduces redeces until no further reduction is possible. For the above example, we first define two datatypes: the datatype of numbers, and the datatype of numbers with variables, which is used for ....
....and they are useful for: Implementing term rewriting systems, program transformation systems, pretty printers, theorem provers, debuggers, and other general purpose systems that are used to reason about and manipulate different datatypes in a structured way. Generalising Haskell s [8] deriving construct. Haskell s deriving construct can be used to generate code for for example the equality function and the printing function on a lot of datatypes. There exist five classes in Haskell that can be used in the deriving construct, and users cannot add new classes to be used in it. ....
J.H. Fasel, P. Hudak, S. Peyton Jones, and P. Wadler. Sigplan Notices Special Issue on the Functional Programming Language Haskell. ACM SIGPLAN notices, 27(5), 1992.
PolyP - a polytypic programming language extension - Jansson, Jeuring (1997) (91 citations) (Correct)
....may occur. 1.4 Background and related work Polytypic functions are standard in the Squiggol community, see [24, 26, 27] Generating instances for specific polytypic functions, such as ( map, cata, hylo, etc. for a given type, is rather simple and has been demonstrated by several authors [3, 8, 11, 13, 31]. Given a number of predefined polytypic functions many others can be defined, and amongst others Jay et al. s type system [2, 13] and Jones type system based on qualified types and higher order polymorphism [18, 20] can be used to type check expressions in a language with predefined polytypic ....
J.H. Fasel, P. Hudak, S. Peyton Jones, and P. Wadler. Sigplan Notices Special Issue on the Functional Programming Language Haskell. ACM SIGPLAN notices, 27(5), 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