Curry: An Integrated Functional Logic Language

More documents

Recommendations

Info

unwords :: [String] -> String unwords ws = if ws==[] then [] else foldr1 (\w s -> w ++ ’ ’:s) ws -- Reverse the order of all elements in a list reverse :: [a] -> [a] reverse = foldl (flip (:)) [] -- Compute the conjunction of a Boolean list and :: [Bool] -> Bool and = foldr (&&) True -- Compute the disjunction of a Boolean list or :: [Bool] -> Bool or = foldr (||) False -- Is there an element in a list satisfying a given predicate? any :: (a -> Bool) -> [a] -> Bool any p = or . map p -- Is a given predicate satisfied by all elements in a list? all :: (a -> Bool) -> [a] -> Bool all p = and . map p -- Element of a list? elem :: a -> [a] -> Bool elem x = any (x==) -- Not element of a list? notElem :: a -> [a] -> Bool notElem x = all (x/=) --- Looks up a key in an association list. lookup :: a -> [(a,b)] -> Maybe b lookup _ [] = Nothing lookup k ((x,y):xys) | k==x = Just y | otherwise = lookup k xys -- Generating arithmetic sequences: enumFrom :: Int -> [Int] -- [n..] enumFrom n = n : enumFrom (n+1) enumFromThen :: Int -> Int -> [Int] -- [n1,n2..] 53
enumFromThen n1 n2 = iterate ((n2-n1)+) n1 enumFromTo :: Int -> Int -> [Int] -- [n..m] enumFromTo n m = if n>m then [] else n : enumFromTo (n+1) m enumFromThenTo :: Int -> Int -> Int -> [Int] -- [n1,n2..m] enumFromThenTo n1 n2 m = takeWhile p (enumFromThen n1 n2) where p x | n2 >= n1 = (x = m) -- Conversion functions between characters and their ASCII values ord :: Char -> Int chr :: Int -> Char -- Convert a term into a printable representation show :: a -> String -- Types of primitive arithmetic functions and predicates (+) :: Int -> Int -> Int (-) :: Int -> Int -> Int (*) :: Int -> Int -> Int div :: Int -> Int -> Int mod :: Int -> Int -> Int ( Int -> Bool (>) :: Int -> Int -> Bool ( Int -> Bool (>=) :: Int -> Int -> Bool -- Constraints -- Equational constraint (=:=) :: a -> a -> Success -- Always solvable constraint success :: Success -- Concurrent conjunction of constraints (&) :: Success -> Success -> Success 54
Page 1 and 2:
Curry An Integrated Functional Logi
Page 3 and 4: 9 Interface to External Functions a
Page 5 and 6: and introduces a new n-ary type con
Page 7 and 8: tion 3 with σ(t1 . . . tn) = σ(t
Page 9 and 10: since the variables occurring in pa
Page 11 and 12: tified variable (and, thus, it can
Page 13 and 14: such cases, anonymous functions (λ
Page 15 and 16: ❀ {x=1,y=3} (The empty constraint
Page 17 and 18: 4.1.3 Functions The type t1 -> t2 i
Page 19 and 20: 4.1.8 Strings The type String is an
Page 21 and 22: g :: [a] -> [b] -> ([a],[b]) g x y
Page 23 and 24: In the last translation rule, conca
Page 25 and 26: to the module head. For instance, a
Page 27 and 28: module main where import m1 hiding
Page 29 and 30: take a character (string) and produ
Page 31 and 32: which takes a search goal and produ
Page 33 and 34: instance, if we want to compute the
Page 35 and 36: Intuitively, a function f declared
Page 37 and 38: 10 Literate Programming To encourag
Page 39 and 40: A Example Programs This section con
Page 41 and 42: A.3 Relational Programming Here is
Page 43 and 44: A.5 Constraint Solving and Concurre
Page 45 and 46: A.6 Concurrent Object-Oriented Prog
Page 47 and 48: B Standard Prelude This section con
Page 49 and 50: not :: Bool -> Bool not True = Fals
Page 51 and 52: foldr1 _ [x] = x foldr1 f (x1:x2:xs
Page 53: takeWhile _ [] = [] takeWhile p (x:
Page 57 and 58: putStr [] = done putStr (c:cs) = pu
Page 59 and 60: owseList (g:gs) = browse g >> putCh
Page 61 and 62: C.2 Layout Similarly to Haskell, a
Page 63 and 64: SimplePattern ::= VariableID | _ |
Page 65 and 66: D Operational Semantics of Curry Th
Page 67 and 68: Computation step for a single expre
Page 69 and 70: Eval [e; rule(l | c = r)] ⇒ {id
Page 71 and 72: to an expression): Eval [ϕ(e1, . .
Page 73 and 74: Eval [try(g)] ⇒ ⎧ [] if Eval [c
Page 75 and 76: D.8 Eliminating Local Declarations
Page 77 and 78: f ′′ x1 . . . xk y1 . . . ym =
Page 79 and 80: References [1] H. Aït-Kaci. An Ove
Page 81 and 82: [29] T. Johnsson. Lambda Lifting: T
Page 83 and 84: Index !!, 49 Dom, 64 VRan, 64 (), 1
Page 85 and 86: higher-order equation, 6 id, 46 if_
show all

Curry: An Integrated Functional Logic Language

Create successful ePaper yourself

Delete template?

Save as template?