id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_6cxmwop5d5b55bclq3wtnkwq6i	Jian-Min Pang	LFTOP: An LF-Based Approach to Domain-Specific Reasoning	2005.0	165	.pdf	application/pdf	51772	9259	79	of type theory and proof assistant in domain-specific areas is that it requires significant Type theory provides good support for generic reasoning and verification. Type theory provides good support for generic reasoning and verification. A domain user who is an non-expert in type theory can then use the resulting • In fact, users can use type theoretic proof assistants such as Coq [Project, 2004] and users operate on Lego directly, in a way which does not reflect domain-specific proof reasoning system for the domain, i.e. design and implement the rules and the user level For example, a lot of specific reasoning tools which are direct implementations of formal systems of specific domains and generic reasoning tools such as proof Type theory contains rules for making judgements of the following four forms: Set theory and the theorem of fixed points are very useful to give a clear semantic interpretation of formal systems.	./cache/work_6cxmwop5d5b55bclq3wtnkwq6i.pdf	./txt/work_6cxmwop5d5b55bclq3wtnkwq6i.txt