Sciweavers

203 search results - page 32 / 41
» Proof Reflection in Coq
Sort
View
CADE
2001
Springer
14 years 8 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
TLCA
2005
Springer
14 years 1 months ago
Privacy in Data Mining Using Formal Methods
There is growing public concern about personal data collected by both private and public sectors. People have very little control over what kinds of data are stored and how such da...
Stan Matwin, Amy P. Felty, István T. Hern&a...
PEPM
2007
ACM
15 years 5 months ago
Concoqtion: Indexed types now!
programming languages community is vigorously pursuing ways to incorporate F!-style indexed types into programming languages. This paper advocates Concoqtion, a practical approach ...
Emir Pasalic, Jeremy G. Siek, Seth Fogarty, Walid ...
ESOP
2010
Springer
14 years 5 months ago
Amortised Resource Analysis with Separation Logic
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...
Robert Atkey
TPHOL
2002
IEEE
14 years 16 days ago
Free-Style Theorem Proving
g Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 ...
David Delahaye