1536 search results - page 168 / 308 » The Underlying Logic of Hoare Logic |
176
click to vote
ECEASST
2008
15 years 6 months ago
2008
: This paper presents a compiler for interaction nets, which, just like term rewriting systems, are user-definable rewrite systems which offer the ability to specify and program. I...
144
click to vote
AML
2006
15 years 6 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
161
click to vote
SYNTHESE
2008
15 years 6 months ago
2008
The present paper offers some remarks on the significance of first order model theory for our understanding of theories, and more generally, for our understanding of the "stru...
164
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
197
click to vote
TMC
2012
13 years 9 months ago
2012
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...