2 Haskell. Haskell (629) 59. Haskell. B. Curry. 1.2, 1.3, Haskell 98 [16] 1. Haskell. Haskell. ( Haskell.

Size: px

Start display at page:

Download "2 Haskell. Haskell (629) 59. Haskell. B. Curry. 1.2, 1.3, Haskell 98 [16] 1. Haskell. Haskell. ( Haskell."

Hester Long
5 years ago
Views:

1 (629) 59 Haskell 1 Haskell Haskell Hugs GHC 2 Haskell 2.1 Haskell 1987 FPCA (Functional Programming Languages and Computer Architechture) Programming Language Haskell and Systems Yoshiyuki ONOUE,, Graduate School of Information Science and Technology, University of Tokyo, Vol.18, No.6(2001), pp [ ] Haskell B. Curry , 1.2, 1.3, Haskell 98 [16] 1 Haskell Haskell Haskell ( Haskell [7] (high-order function) (lazy evaluation) / (nonstrictness) (pattern matching) Haskell 1. (polymorphism) / (overloading)

2 60 (630) 2. Haskell Monad 3. / (list/array comprehension) {x 2 x {1,...,100},x is odd} [ x*x x<-[1..100], odd x] 4. Haskell Haskell 21 Haskell 2.2 Haskell [16] Haskell Haskell [2] [9][19] Ramanujan [17] Ramanujan x = a 3 + b 3 = c 3 + d 3 (1) a c, a d [17] Miranda[20] 1 Haskell 3 (Main.hs, Rama.hs, Sort.hs) Haskell.hs Main main -- (l.10) {-,-} (ll.27 30) 2 / l.6 l.19 ramanujan, fsort l.1 l.3 l.8 l.3 Rama ll r x <= r y l.34 l.35 ll.33 2,3 fmerge main Haskell

3 (631) Vol. 18 No. 6 Nov module Main where 2 3 import Rama 4 Main.hs 5 main = print (take 3 ramanujan) Rama.hs 6 module Rama ( ramanujan ) where 7 8 import Sort ( fsort ) Finding Ramanujan numbers ramanujan :: [((Int,Int), (Int,Int))] 13 ramanujan = [(x,y) (x,y)<-zip s (tail s), 14 sumcubes x == sumcubes y] 15 where s = fsort sumcubes sumcubes :: (Int,Int) -> Int 18 sumcubes (a,b) = a^3 + b^3 Sort.hs 19 module Sort ( fsort ) where fsort :: ((Int,Int) -> Int) -> Int 22 -> [(Int,Int)] 23 fsort r k 24 = (k,k) : fmerge r [(k,b) b<-[k+1..]] 25 (fsort r (k+1)) {- 28 Two argument lists should be infinite, 29 so there is no definition for null list. 30 -} fmerge :: (a->int) -> [a] -> [a] -> [a] 33 fmerge r (x:xs) (y:ys) 34 r x <= r y = x : fmerge r xs (y:ys) 35 otherwise = y : fmerge r (x:xs) ys 1 Ramanujan l.15 fsort sumcubes 1 [(1,1),(1,2),(2,2),(1,3),(2,3),(3,3),(1,4), (2,4),(3,4),(1,5),(4,4),(2,5),(3,5),..] 2 3 Ramanujan Hello, World! 1 (Hello.hs) main = putstr "Hello, World!\n" module module Main where Main putstr print putstr 3 Hugs 3.1 Hugs 2 Mark P. Jones Haskell Hugs 98 ( ) Unix Windows Win32, Linux, Machintosh Windows Hugs (winhugs) GUI winhugs 2 Hugs 98,

4 62 (632) 1 % hugs 2 (......) 3 4 Hugs session for: 5 /usr/local/share/hugs/lib/prelude.hs 6 Type :? for help 7 Prelude> sum [1..10] Prelude> :load Hello.hs 10 Reading file "Hello.hs": Hugs session for: 13 /usr/local/share/hugs/lib/prelude.hs 14 Hello.hs 15 Main> main 16 Hello, World! Main> :quit 19 [Leaving Hugs] 20 % hugs Hugs hugs 2 Hugs 1 5 Prelude.hs Haskell : Hugs Hugs :? +s :set +s +t :set +t -hnum :set -98 Haskell 98 Hugs runhugs (literate Haskell) 1 #! runhugs #!/usr/local/bin/runhugs > main = putstr "Hello, World!\n" literate Haskell Knuth (literate programming) Haskell >.lhs runhugs literate Haskell 1 #! 3.3 Haskell Haskell Haskell 98 [15] Prelude import Hugs

5 (633) Vol. 18 No. 6 Nov :find func -E :browse modules ( 2 /usr/local/share/hugs/lib/) Prelude.hs :also import 4 GHC GHC 3 Glasgow Haskell OS ( ) GHC 5.02 x86 Win32, Linux, FreeBSD sparc Solaris 3 The Glasgow Haskell Compiler, GHC 100MB perl, gcc, Happy Happy Haskell C yacc Happy Haskell Happy Haskell Happy Win32, Linux, FreeBSD, Solaris GHC GHC GHC Happy GHC 4.2 gcc C Haskell (Haskell )Main main a.out -o -O % ghc -O -o main Main.hs %./main --help GHC GHC (Native Code Generator, NCG) Haskell

6 64 (634) NCG C gcc gcc C -C -S -c -v rama -hc 177,974 bytes x seconds Tue Jun 5 10: bytes 12k ramanujan/fsort 10k fsort/fmerge 8k 6k MAIN/CAF 4k MAIN/main 2k 0k seconds 3 1 % ghci Main.hs 2 (......) GHC -prof -auto-all -auto-all +RTS -p +RTS -h +RTS -p.prof +RTS -h.hp hp2ps PostScript ( 3) 4 Loading package std... linking... done. 5 Compiling Sort ( Sort.hs, interpreted ) 6 Compiling Rama ( Rama.hs, interpreted ) 7 Compiling Main ( Main.hs, interpreted ) 8 Main> :set +s 9 Main> main 10 [((1,12),(9,10)),((2,16),(9,15)),((2,24),(18,20))] 11 (0.10 secs, bytes) 12 Main> :quit 13 Leaving GHCi. 14 % 4 ghci Ramanujan 4.4 GHCi GHC 5.0 (GHCi) ghci ghc --interactive 4 Ramanujan ghci Hugs :load, :? Haskell Makefile ( Main) --make

7 (635) Vol. 18 No. 6 Nov Hugs, GHC [sec] [MB] Hugs 5.27 GHCi GHC GHC O Hugs GHC Hugs GHC Ramanujan 10 PC/AT (Pentium II Xeon 450MHz, 512MB) Hugs GHC 2 GHCi Hugs 10 2 GHC 5.0 Haskell Hugs Haskell [6][8] [3] Ackermann 25 C, C++, Java Lisp, Scheme, SML Perl, Python, Ruby awk, bash UNIX 30 3 GHC main GHC Haskell [3] 5.2 Hugs G-machine (abstract machine) G-machine [1][10] G-code Hugs Haskell G-code G-machine G-code GHC Core STG (Spineless Tagless G-machine [13] ) C C ( 5 ) Core STG G-code Core / STG [14]

8 66 (636) GHC Compiler Overview Haskell Source Optimization passes Optimization passes 5 Parser,Reader Renamer,Desugarer Type checker Core Syntax CoreToStg Stg Syntax GHC CodeGen, Flattern C C Compiler Native code Core (program fusion) [11] [12] GHC [4] [5] 6 [18] (calculation) [ 1 ] Augustsson, A: A Compiler for Lazy ML, Proc. of the ACM Symposium on Lisp and Functional Programming, ACM Press, 1984, pp [2] Bird, R.: Introduction to Functional Programming using Haskell, 2nd edition, Prentice Hall Press, 1998, [ 3 ] Bagley, D.: The Great Computer Language Shootout, shootout/ [ 4 ] Chakravarty, M.: The Glasgow Haskell Compiler Commentary. ~chak/haskell/ghc/comm/. [ 5 ] Chitil, O.: Adding an Optimisation Pass to the Glasgow Haskell Compiler, unpublished, www-users.cs.york.ac.uk/~olaf/ PUBLICATIONS/extendGHC.ps.gz. [ 6 ] Hartel, P. H. et al.: Benchmarking Implementations of Functional Languages with Pseudoknot, a Float-Intensive Benchmark, J. Functional Programming, Vol.6, No.4 (1996), pp [ 7 ] Hudak, P.: Conception, Evolution, and Application of Functional Programming Languages, ACM Computing Survey, Vol.21, No.3 (1989), pp ( :, 89,, 1991, pp ) [ 8 ] Hudak, P. and Jones, M. P.: Haskell vs. Ada vs. C++ vs. Awk vs...., An Experiment in Software Prototyping Productivity, unpublished, [ 9 ] Hudak, P., Peterson, J. and Fasel, J.: A Gentle Introduction to Haskell, tutorial/. [10] Johnsson, T.: Efficient Compilation of Lazy Evaluation, Proc. SIGPLAN 84 Symposium on Compiler Construction, ACM Press, 1984, pp [11],, : HYLO,, Vol.15, No.6 (1998), pp [12],,, :,, Vol.17, No.3 (2000), pp [13] Peyton Jones, S. L.: Implementing Lazy Functional Languages on Stock Hardware: the Spineless Tagless G-machine, J. Functional Programming, Vol.2, No.2 (1992), pp [14] Peyton Jones, S. L. and Santos, A: A transformation-based optimiser for Haskell, Science of Computer Programming, Vol.32, No.1 3 (1998), pp [15] Peyton Jones, S. L. and Hughes, J. (eds.): Standard libraries for the Haskell 98 Programming

9 (637) Vol. 18 No. 6 Nov Language, Department of Computer Science Tech Report YALEU/DCS/RR-1105, Yale University, [16] Peyton Jones, S. L. and Hughes, J. (eds.): Report on the Programming Language Haskell 98, Department of Computer Science Tech Report YALEU/DCS/RR-1106, Yale University, [17] :,, Vol.9, No.1 (1991), pp [18] :, bit, Vol.31, No.3 (1999), pp [19] Thompson, S.: Haskell: The Craft of Functional Programming, 2nd edition, Addison-Wesley, [20] Turner, D. A.: Miranda: a non-strict functional language with polymorphic types, Functional Programming Languages and Computer Architecture, Springer-Verlag, LNCS 201, 1985, pp.1 16.

which a value is evaluated. When parallelising a program, instances of this class need to be produced for all the program's types. The paper commented

which a value is evaluated. When parallelising a program, instances of this class need to be produced for all the program's types. The paper commented A Type-Sensitive Preprocessor For Haskell Noel Winstanley Department of Computer Science University of Glasgow September 4, 1997 Abstract This paper presents a preprocessor which generates code from type