1679 search results - page 7 / 336 » Strong order equivalence |
TACS
2001
Springer
14 years 1 months ago
2001
Springer
Parigot suggested symmetric structural reduction rules for ion to µ-abstraction in [9] to ensure unique representation of data type. We prove strong normalization of second order ...
TCS
2010
13 years 7 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
BSL
2010
13 years 6 months ago
2010
CORR
2011
Springer
13 years 10 days ago
2011
Springer
LICS
2006
IEEE
14 years 2 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...