Results 1 
1 of
1
Faster Proof Checking in the Edinburgh Logical Framework
 In 18th International Conference on Automated Deduction
, 2002
"... 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 f ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
(Show Context)
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.