Sciweavers

6 search results - page 1 / 2
» lfcs 1997
Sort
View
LFCS
1997
Springer
13 years 9 months ago
Type Introduction for Equational Rewriting
Hitoshi Ohsaki, Aart Middeldorp
LFCS
1997
Springer
13 years 9 months ago
Basic Forward Chaining Construction for Logic Programs
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
LFCS
1997
Springer
13 years 9 months ago
Back-Forth Equivalences for Design of Concurrent Systems
The paper is devoted to the investigation of behavioural equivalences of concurrent systems modelled by Petri nets. Back-forth bisimulation equivalences known from the literature a...
Igor V. Tarasyuk
LFCS
1997
Springer
13 years 9 months ago
The Concurrency Complexity for the Horn Fragment of Linear Logic
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish t...
Sergey Dudakov
LICS
1997
IEEE
13 years 9 months ago
Full Abstraction for Functional Languages with Control
traction for Functional Languages with Control James Laird LFCS, Department of Computer Science University of Edinburgh This paper considers the consequences of relaxing the brack...
James Laird