A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof-search tactics in logic and type theory can be seen as the root-first applications of rules in an appropriate sequent calculus, preferably without the redundancies generated by permutation of rules. This paper addresses the issues of defining such sequent calculi for Pure Type Systems (P...
| Váldodahkkit: | , , |
|---|---|
| Materiálatiipa: | Artihkal |
| Giella: | English |
| Almmustuhtton: |
Logical Methods in Computer Science e.V.
2011-03-01
|
| Ráidu: | Logical Methods in Computer Science |
| Fáttát: | |
| Liŋkkat: | https://lmcs.episciences.org/842/pdf |