Article thumbnail

ALLIGATOR: THEOREM PROVING FOR DEPENDENT TYPE SYSTEMS WITH SIGMA TYPES

By Paul Piwek

Abstract

Abstract This paper describes a theorem prover for Dependent Type Systems. We start with an introduction to Dependent Type Systems and highlight the properties that make them specifically suited for computational semantics. We proceed with a brief description of the ALLIGATOR system, including its architecture and some implementation issues. Alligator works with a specific generalization of Dependent Type Systems: Pure Type Systems extended with Sigma Types. The paper concludes with examples of proofs constructed by ALLIGA-TOR. These have been selected to illustrate how certain problems in anaphora/presupposition resolution can be addressed with the current system.

Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.121.6754
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://mcs.open.ac.uk/pp2464/a... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.