3319 search results - page 186 / 664 » Subshifts, Languages and Logic |
182
click to vote
AGP
1997
IEEE
15 years 10 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
153
click to vote
KR
1998
Springer
15 years 10 months ago
1998
Springer
The paper investigates the characterisation of vague concepts within the framework of modal logic. This work builds on the supervaluation approach of Fine and exploits the idea of...
270
click to vote
ECOOP
2009
Springer
16 years 7 months ago
2009
Springer
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...
159
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
181
click to vote
LFCS
2009
Springer
16 years 1 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...