11 search results - page 2 / 3 » Full Completeness of the Multiplicative Linear Logic of Chu ... |
AMAST
1991
Springer
13 years 9 months ago
1991
Springer
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
APAL
2007
13 years 5 months ago
2007
In this paper, we present a categorical model for Multiplicative Additive Polarized Linear Logic MALLP, which is the linear fragment (without structural rules) of Olivier Laurentā...
CTCS
1989
Springer
13 years 9 months ago
1989
Springer
We introduce the notion of a candidate for āmultiple valued universal constructionsā and deļ¬ne stable functors (which generalise functors with left adjoints) in terms of fac...
ICFP
2007
ACM
14 years 5 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
APAL
2002
13 years 5 months ago
2002
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An ...