What steps will reproduce the problem?
1. Create the following grammars:
abstract Test = {
cat A ;
fun aa : A ;
}
concrete TestA of Test = {
lincat A = { s : Str } ;
lin aa = { s = "aa" } ;
}
concrete TestB of Test = TestA - [ aa ] ** {
lin aa = { s = "bb" } ;
}
2. Import TestB in the shell
> i -retain TestB.gf
3. Compute term `aa`
> cc aa
What is the expected output? What do you see instead?
Expected output:
{s = "bb"}
Actual output:
{s = "aa"; lock_A = <>}
Original issue reported on code.google.com by gregoire...@gmail.com on 29 Apr 2013 at 2:12
Original issue reported on code.google.com by
gregoire...@gmail.com
on 29 Apr 2013 at 2:12