lambda/lambda.hs

94 lines
3.8 KiB
Haskell

import Data.List
-- A symbol denoting a variable; consists of a textual name and some (or no) apostrophes to ensure uniqueness
data Symbol = Symbol { symBase :: String -- lowercase a to z
, symLen :: Int -- nonnegative
}
deriving (Eq)
instance Show Symbol where
show (Symbol s n) = s ++ (replicate n '\'')
-- Present symbols (not including symbol to change) -> symbol to change ->
-- unique symbol with same base and minimal amount of apostrophes
findName :: [Symbol] -> Symbol -> Symbol
findName other (Symbol base n) =
let sameBase = filter ((base ==) . symBase) other
lengths = map symLen sameBase
freeLengths = [0..] \\ (nub lengths)
in Symbol base (head freeLengths) -- [0..] is infinite
-- An expression. Can be a mere symbol, a lambda application, or a lambda abstraction.
data Expression s = ESymbol s
| EExpr (Expression s) (Expression s)
| ELambda s (Expression s)
instance (Show s) => Show (Expression s) where
show (ESymbol s) = show s
-- ((a b) c) is equivalent to (a b c)
show (EExpr a@(EExpr _ _) b) = (init $ show a) ++ " " ++ show b ++ ")"
show (EExpr a b) = "(" ++ show a ++ " " ++ show b ++ ")"
show (ELambda s e) = "\\" ++ show s ++ "." ++ show e
{-
Apply a function
Insert an expression into another expression:
replace all symbols s with an expression
change all symbols within that expression to be unique in the expression's new context
-}
makeUnique :: [Symbol] -> Expression Symbol -> Expression Symbol
makeUnique context (ESymbol s) = ESymbol (findName context s)
makeUnique context (EExpr a b) = EExpr (makeUnique context a) (makeUnique context b)
makeUnique context (ELambda l e) = ELambda (findName context l) (makeUnique context e)
insertExpr :: Symbol -> Expression Symbol -> [Symbol] -> Expression Symbol -> Expression Symbol
insertExpr r new context old@(ESymbol s)
| r == s = makeUnique context new
| otherwise = old
insertExpr r new context (EExpr a b) = EExpr (insertExpr r new context a) (insertExpr r new context b)
insertExpr r new context (ELambda l e) = ELambda l (insertExpr r new (l : context) e)
apply :: Expression Symbol -> Expression Symbol
apply (EExpr (ELambda s l) b) = insertExpr s b [] l -- [], not [s]
apply (EExpr a@(EExpr _ _) b) = EExpr (apply a) b
apply e = e
_s :: String -> Expression Symbol
_s s = ESymbol $ _ss s
_ss :: String -> Symbol
_ss s = Symbol s 0
main = do
putStrLn "Testing: Showing expressions"
print (EExpr (_s "a") (EExpr (_s "b") (_s "c")))
print (EExpr (_s "a") (EExpr (_s "b") (EExpr (_s "c") (_s "d"))))
print (EExpr (EExpr (_s "a") (_s "b")) (_s "c"))
print (EExpr (EExpr (EExpr (_s "a") (_s "b")) (_s "c")) (_s "d"))
print (EExpr (EExpr (_s "a") (EExpr (_s "b") (_s "c"))) (_s "d"))
print (ELambda (Symbol "a" 0) (_s "a"))
print (ELambda (Symbol "a" 0) (EExpr (EExpr (_s "a") (EExpr (_s "b") (_s "c"))) (_s "d")))
putStrLn ""
-- test of findName (seems to be working) ~G
putStrLn "Testing: Finding new symbols"
print $ findName [(Symbol "a" 0), (Symbol "b" 0), (Symbol "a" 1)] (Symbol "a" 4)
print $ findName [(Symbol "a" 0), (Symbol "b" 0), (Symbol "a" 1)] (Symbol "b" 3)
print $ findName [(Symbol "a" 0), (Symbol "b" 0), (Symbol "a" 1)] (Symbol "c" 2)
print $ findName [(Symbol "a" 1), (Symbol "a" 3), (Symbol "a" 0)] (Symbol "a" 1)
putStrLn ""
putStrLn "Testing: Applying expressions"
let t = (ELambda (_ss "a") (ELambda (_ss "b") (ESymbol (_ss "a"))))
f = (ELambda (_ss "a") (ELambda (_ss "b") (ESymbol (_ss "b"))))
n = (ELambda (_ss "a") (EExpr (EExpr (ESymbol (_ss "a")) (makeUnique [(_ss "a")] f)) (makeUnique [(_ss "a")] t)))
print t
print f
print n
putStrLn "Running: not false"
print (EExpr n f)
print . apply $ (EExpr n f)
print . apply . apply $ (EExpr n f)
print . apply . apply . apply $ (EExpr n f)
putStrLn ""