-
Notifications
You must be signed in to change notification settings - Fork 4
/
Runtime.hs
171 lines (139 loc) · 5.21 KB
/
Runtime.hs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
-- Copyright © 2009 CNRS - École Polytechnique - INRIA.
-- Copyright © 2011 Mathieu Boespflug.
--
-- Permission to use, copy, modify, and distribute this file for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
--
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-- | All generated Haskell files import this module. The data type
-- declarations are given here, along with the conversion relation and type
-- inference function.
module Dedukti.Runtime
( Code(..), Term(..), Pair(..), ap
, convertible
, bbox, sbox
, start, stop
, checkDeclaration
, checkRule) where
import qualified Data.ByteString.Char8 as B
import Control.Exception
import Text.Show.Functions ()
import Data.Typeable
import Prelude hiding (pi, catch)
import Data.Time.Clock
import Text.PrettyPrint.Leijen
import System.Exit
import System.Posix.Process (exitImmediately)
-- Exceptions
data SortError = SortError
deriving (Show, Typeable)
data CheckError = CheckError
deriving (Show, Typeable)
data SynthError = SynthError
deriving (Show, Typeable)
data ConvError = ConvError Doc Doc
deriving (Show, Typeable)
data RuleError = RuleError
deriving (Show, Typeable)
instance Exception SortError
instance Exception CheckError
instance Exception SynthError
instance Exception ConvError
instance Exception RuleError
-- Convertible and static terms.
data Code = Var !Int
| Con !B.ByteString
| Lam !(Code -> Code)
| Pi Code !(Code -> Code)
| App Code Code
| Type
| Kind
deriving (Eq, Show)
instance Eq (Code -> Code)
data Term = TLam !(Maybe Term) !(Pair -> Term)
| TLet !Pair !(Pair -> Term)
| TPi !Term !(Pair -> Term)
| TApp !Term !Pair
| TType
| Box Code Code -- For typechecking purposes, not user generated.
deriving Show
data Pair = Pair Term Code
deriving Show
ap :: Code -> Code -> Code
ap (Lam f) t = f t
ap t1 t2 = App t1 t2
convertible :: Int -> Code -> Code -> ()
convertible n t1 t2 | conv n t1 t2 = ()
| otherwise = throw $ ConvError (prettyCode n t1) (prettyCode n t2)
where conv n (Var x) (Var x') = x == x'
conv n (Con c) (Con c') = c == c'
conv n (Lam t) (Lam t') =
conv (n + 1) (t (Var n)) (t' (Var n))
conv n (Pi ty1 ty2) (Pi ty3 ty4) =
conv n ty1 ty3 && conv (n + 1) (ty2 (Var n)) (ty4 (Var n))
conv n (App t1 t2) (App t3 t4) =
conv n t1 t3 && conv n t2 t4
conv n Type Type = True
conv n Kind Kind = True
conv n _ _ = False
bbox, sbox :: Term -> Code -> Code -> Term
-- | A big box holds terms of sort Type or Kind
bbox = box [Type, Kind]
-- | A small box holds terms of sort Type.
sbox = box [Type]
box sorts ty ty_code obj_code
| synth 0 ty `elem` sorts = Box ty_code obj_code
| otherwise = throw SortError
mkpair n ty = Pair (Box ty (Var n)) (Var n)
check :: Int -> Term -> Code -> ()
check n (TLam _ f) (Pi a f') = check (n + 1) (f (mkpair n a)) (f' (Var n))
check n (TLet (Pair t tc) f) ty
| tyt <- synth n t = check (n + 1) (f (Pair (Box tyt tc) tc)) ty
check n t ty = convertible n (synth n t) ty
synth :: Int -> Term -> Code
synth n (Box ty _) = ty
synth n (TPi (Box Type tya) f) = synth (n + 1) (f (mkpair n tya))
synth n (TApp t1 (Pair t2 c2))
| Pi tya f <- synth n t1
, () <- check n t2 tya = f c2
synth n TType = Kind
synth n (TLam (Just (Box Type ty)) f) =
Pi ty (\xc -> synth (n + 1) (f (Pair (Box ty xc) xc)))
synth n t = throw SynthError
checkDeclaration :: String -> a -> IO ()
checkDeclaration x t = catch (evaluate t >> putStrLn ("Checked " ++ x ++ ".")) handler
where handler (SomeException e) = do
putStrLn $ "Error during checking of " ++ x ++ "."
throw e
checkRule :: Term -> Term -> ()
checkRule lhs rhs | ty <- synth 0 lhs, () <- check 0 rhs ty = ()
| otherwise = throw $ RuleError
-- Function utilites.
start :: IO UTCTime
start = do
putStrLn "Start."
getCurrentTime
stop :: UTCTime -> IO ()
stop t = do
t' <- getCurrentTime
let total = diffUTCTime t' t
putStrLn $ "Stop. Runtime: " ++ show total
exitImmediately ExitSuccess -- Use Posix exitImmediately rather than System.Exit to really exit GHCi.
-- Pretty printing.
prettyCode n (Var x) = text (show x)
prettyCode n (Con c) = text (show c)
prettyCode n (Lam f) =
parens (int n <+> text "=>" <+> prettyCode (n + 1) (f (Var n)))
prettyCode n (Pi ty1 ty2) =
parens (int n <+> colon <+> prettyCode n ty1 <+> text "->" <+> prettyCode (n + 1) (ty2 (Var n)))
prettyCode n (App t1 t2) =
parens (prettyCode n t1 <+> prettyCode n t2)
prettyCode n Type = text "Type"
prettyCode n Kind = text "Kind"