Faster Proof Checking in the Edinburgh Logical Framework

Faster Proof Checking in the Edinburgh Logical Framework (2002)

by Aaron Stump , David L. Dill

Venue:	In 18th International Conference on Automated Deduction
Citations:	12 - 3 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Faster Proof Checking in the Edinburgh Logical Framework	user correction - Legacy Corrections
AUTHOR NAME	Aaron Stump	user correction - Legacy Corrections
AUTHOR AFFIL	Computer Systems Laboratory; Stanford University, Stanford	user correction - Legacy Corrections
AUTHOR ADDR	CA 94305, USA	user correction - Legacy Corrections
AUTHOR NAME	David L. Dill	user correction - Legacy Corrections
AUTHOR AFFIL	Computer Systems Laboratory; Stanford University, Stanford	user correction - Legacy Corrections
AUTHOR ADDR	CA 94305, USA	user correction - Legacy Corrections
ABSTRACT	This paper describes optimizations for checking proofs represented in the Edinburgh Logical Framework (LF). The optimizations allow large proofs to be checked eciently which cannot feasibly be checked using the standard algorithm for LF. The crucial optimization is a form of result caching. To formalize this optimization, a path calculus for LF is developed and shown equivalent to a standard calculus.	user correction - Legacy Corrections
YEAR	2002	INFERENCE
VENUE	In 18th International Conference on Automated Deduction	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	392--407	INFERENCE
VOLUME	2392	INFERENCE
CITATIONS	23 found	ParsCit 1.0