Sciweavers

842 search results - page 141 / 169
» Linear logic
Sort
View
CONCUR
2007
Springer
14 years 1 months ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram
ICWS
2004
IEEE
13 years 9 months ago
Logic-based Web Services Composition: From Service Description to Process Model
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses Semantic Web service language (DAML-S) f...
Jinghai Rao, Peep Küngas, Mihhail Matskin
EACL
1993
ACL Anthology
13 years 9 months ago
LFG Semantics via Constraints
Semantic theories of natural language associate meanings with utterances by providing meanings for lexical items and rules for determining the meaning of larger units given the me...
Mary Dalrymple, John Lamping, Vijay A. Saraswat
ACS
2007
13 years 7 months ago
A Topologist's View of Chu Spaces
Abstract. For a symmetric monoidal-closed category X and any object K, the category of K-Chu spaces is small-topological over X and small cotopological over Xop . Its full subcateg...
Eraldo Giuli, Walter Tholen
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 7 months ago
Taming Modal Impredicativity: Superlazy Reduction
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
Ugo Dal Lago, Luca Roversi, Luca Vercelli