3 search results - page 1 / 1 » The Theory of Calculi with Explicit Substitutions Revisited |
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...
CSL
2006
Springer
13 years 8 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...
CORR
2010
Springer
13 years 2 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...