C. Okasaki. FUNCTIONAL PEARL Even Higher-Order Functions for Parsing or Why Would Anyone Ever Want to Use a Sixth-Order Function? Journal of Functional Programming, 8(2):195-199, March 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Unification via the ...-Style of Explicit Substitutions - Ayala-Rincon, al. (2001) (Correct)
....context, is the calculus. Rewriting could be performed modulo the rules of the calculus or combining speci cations with the rules of the calculus. The function map is a typical example of a second order function, but functions of third order or above have practical interest too. In [36], useful third until sixth order functions were presented in the context of combinator parsing. A simple example of a HOU problem is to search for solutions for the equality F (f(a) f(F (a) The identity function fF= x :xg is a solution, and so are the functions fF (x) f n (x) j n 2 Ng. ....
C. Okasaki. FUNCTIONAL PEARL Even Higher-Order Functions for Parsing or Why Would Anyone Ever Want to Use a Sixth-Order Function? Journal of Functional Programming, 8(2):195-199, March 1999.
Higher Order Unification via ...-Style of Explicit.. - Ayala-Rincon, Kamareddine (Correct)
....rewriting context, is the calculus. Rewriting could be performed modulo the rules of the calculus or combining speci cation and the rules of the calculus. The function map is a typical example of a second order function, but functions of third order or above have practical interest too. In [Oka99] useful thirduntil sixth order functions were presented in the context of combinator parsing. A simple example of a HOU problem is to search for solutions for the equality F (f(a) f(F (a) or ( y :F x :f) a) x :f y :F ) a) A solution is the function identity fF= x :xg, but fF ....
C. Okasaki. FUNCTIONAL PEARL Even Higher-Order Functions for Parsing or Why Would Anyone Ever Want to Use a Sixth-Order Function? Journal of Functional Programming, 8(2):195-199, March 1999.
Unification via ...-Style of Explicit Substitution - Ayala-Rincón, Kamareddine (2000) (Correct)
....context, is the calculus. Rewriting could be performed modulo the rules of the calculus or combining speci cations with the rules of the calculus. The function map is a typical example of a second order function, but functions of third order or above have practical interest too. In [22] useful third until sixth order functions were presented in the context of combinator parsing. A simple example of a HOU problem is the search for solutions for the equality (F (f) a) f(F (a) A solution is the function identity fF= x:xg, but fF (x) x :f n (x) j n 2 Ng are solutions too. ....
C. Okasaki. FUNCTIONAL PEARL Even Higher-Order Functions for Parsing or Why Would Anyone Ever Want to Use a Sixth-Order Function? Journal of Functional Programming, 8(2):195-199, March 1999.
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