95 search results - page 12 / 19 » Automated Proof Construction in Type Theory Using Resolution |
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as p...
ASYNC
2001
IEEE
13 years 11 months ago
2001
IEEE
This paper describes the synthesis and hardware implementation of a signal-type asynchronous data communication mechanism (ACM). Such an ACM can be used in systems where a data-dr...
LICS
2003
IEEE
14 years 18 days ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
POPL
2012
ACM
12 years 2 months ago
2012
ACM
Despite recent successes, large-scale proof development within proof assistants remains an arcane art that is extremely timeconsuming. We argue that this can be attributed to two ...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...