852 search results - page 159 / 171 » entcs 2010 |
104
click to vote
ENTCS
2006
14 years 10 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
106
click to vote
ENTCS
2006
14 years 10 months ago
2006
This paper presents a game semantics for LP, Artemov's Logic of Proofs. The language of LP extends that of propositional logic by adding formula-labeling terms, permitting us...
ENTCS
2007
14 years 10 months ago
2007
Logical connectives familiar from the study of hybrid logic can be added to the logical framework LF, a constructive type theory of dependent functions. This extension turns out t...
ENTCS
2000
14 years 10 months ago
2000
Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not r...
ENTCS
2002
14 years 10 months ago
2002
Category theory has proved a useful tool in the study of type systems for sequential programming languages. Various approaches have been proposed to use categorical models to exam...