63 search results - page 9 / 13 » Short proofs of strong normalization |
ICS
2010
Tsinghua U.
14 years 8 months ago
2010
Tsinghua U.
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
COCOON
2007
Springer
14 years 5 months ago
2007
Springer
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between the...
TAPSOFT
1997
Springer
14 years 2 months ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
CSL
2005
Springer
14 years 4 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
PARLE
1987
14 years 2 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...