144 search results - page 8 / 29 » A Fully Abstract Semantics for a Functional Language with Lo... |
175
click to vote
ALP
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
141
Voted
AGP
1997
IEEE
15 years 7 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 ...
107
Voted
RTA
2010
Springer
15 years 7 months ago
2010
Springer
The K framework, based on rewriting logic semantics, provides a powerful logic for defining the semantics of programming languages. While most work in this area has focused on de...
124
click to vote
ENTCS
2002
15 years 3 months ago
2002
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
138
Voted
SEMWEB
2009
Springer
15 years 10 months ago
2009
Springer
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...