2236 search results - page 105 / 448 » Language Independence and Language Tolerance in Logic Progra... |
162
click to vote
ENTCS
2002
15 years 6 months ago
2002
In this paper we present a framework to program autonomous robots in the declarative multi-paradigm language Curry. This is an experiment to use high-level declarative programming...
192
click to vote
FOIKS
2010
Springer
16 years 26 days ago
2010
Springer
As a vision for the future of the Web, the Semantic Web is an open, constantly changing and collaborative environment. Hence it is reasonable to expect that knowledge sources in th...
153
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
148
click to vote
FOAL
2007
ACM
15 years 10 months ago
2007
ACM
The relation between aspects and monads is a recurring topic in discussions in the programming language community, although it has never been elaborated whether their resemblences...
134
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...