37 search results - page 4 / 8 » Rewriting Calculus with(out) Types |
IFIP
2004
Springer
14 years 27 days ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...