Sequent Calculi for the Normal Terms of the - and - Calculi

@article{Pinto1998SequentCF,
  title={Sequent Calculi for the Normal Terms of the - and - Calculi},
  author={Lu{\'i}s Pinto and Roy Dyckhoff},
  journal={Electr. Notes Theor. Comput. Sci.},
  year={1998},
  volume={17},
  pages={1-14}
}
This paper presents two sequent calculi, requiring no clausal form for types, whose typable terms are in 1-1 correspondence with the normal terms of the-and-calculi. Such sequent calculi allow no permutations in the order in which inference rules occur on derivations of typable terms and are thus appropriate for proof search. In these calculi proof search can be performed in a root-rst fashion and type conversions are solely required in axiom formation. 1 The-calculus The-calculus 6, 9] is a… CONTINUE READING
6 Citations
13 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 13 references

A permutation-free sequent calculus for intuitionistic logic Res. Rep. CS/96/9, from \http://www-theory.dcs.st-and.ac.uk/ rd/

  • R. Dyckho, L. Pinto
  • 1996
1 Excerpt

A framework for de ning logics

  • R. Harper, F. Honsell, G. Plotkin
  • J. Association for Computing Machinery
  • 1993
3 Excerpts

Lambda calculi with types

  • H. Barendregt
  • Handbook of Logic in Computer Science
  • 1993
2 Excerpts

Proof-search in the -calculus

  • D. Pym, L. Wallen
  • Logical Frameworks,
  • 1991
1 Excerpt

Similar Papers

Loading similar papers…