Implement prolog-style unification
This commit is contained in:
parent
89c942e81e
commit
37c1307d54
2 changed files with 133 additions and 34 deletions
13
app/Main.hs
13
app/Main.hs
|
|
@ -1,15 +1,4 @@
|
|||
module Main where
|
||||
|
||||
import Data.Void
|
||||
|
||||
import Props.Lambda.Term
|
||||
|
||||
yCombinator :: Term Void String String
|
||||
yCombinator = Lambda "f"
|
||||
(App
|
||||
(Lambda "x" (App (Var 1) (App (Var 0) (Var 0))))
|
||||
(Lambda "x" (App (Var 1) (App (Var 0) (Var 0))))
|
||||
)
|
||||
|
||||
main :: IO ()
|
||||
main = print yCombinator
|
||||
main = putStrLn "Hello world!"
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue