Sciweavers

3994 search results - page 38 / 799
» A Linear Logical Framework
Sort
View
100
Voted
LFCS
1997
Springer
15 years 4 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
APAL
2008
67views more  APAL 2008»
15 years 15 days ago
Proof nets sequentialisation in multiplicative linear logic
Abstract. We provide an alternative proof of the sequentialisation theorem for proof nets of multiplicative linear logic. Namely, we show how a proof net can be transformed into a ...
Paolo Di Giamberardino, Claudia Faggian
LOGCOM
2000
69views more  LOGCOM 2000»
15 years 5 days ago
Object calculi in linear logic
Several calculi of objects have been studied in the recent literature, that support the central features of object-based languages: messages, inheritance, dynamic dispatch, object...
Michele Bugliesi, Giorgio Delzanno, Luigi Liquori,...
93
Voted
JOLLI
2002
109views more  JOLLI 2002»
15 years 1 days ago
Linear, Branching Time and Joint Closure Semantics for Temporal Logic
Temporal logic can be used to describe processes: their behaviour is characterized by a set of temporal models axiomatized by a temporal theory. Two types of models are most often ...
Joeri Engelfriet, Jan Treur
CONCUR
2007
Springer
15 years 6 months ago
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
Abstract. We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular i...
Martin Lange