singleton list (`A) in Coq? -
i trying understand , compile linear logic formalization in coq: http://www.cs.nuim.ie/~jpower/research/linearlogic/ http://www.cs.nuim.ie/~jpower/research/linearlogic/ill.v
here code:
inductive lincons : (list ilinprop) -> ilinprop -> prop := (* structural rules *) identity : (a:ilinprop) (`a |- a) | exchange : (a,b,c : ilinprop)(d1,d2 : (list ilinprop)) ((d1 ^ `a ^ `b ^ d2 |- c) -> (d1 ^ `b ^ `a ^ d2 |- c)) ...
but code not compile, giving error message syntax error: lexer: undefined token
code piece `a.
it said in accompanying article ` simbol denotes singleton list consisting 1 element , ^ symbol if concatenation of lists.
so - why recent (coqide 8.6.1) coq not recognize symbols , should import addidional theories @ start of ill.v file?
the syntax file uses defined in morelists file part of development. however, paper written in 1999, , version of coq used there has little current one. sadly, seems need lot of work port development work now. instance, coq had different set of basic tactics, different standard library, , different syntax extension mechanism.
Comments
Post a Comment