6274 search results - page 118 / 1255 » Proofs, Programs, Processes |
308
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows ...
176
click to vote
CONCUR
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. We introduce a novel way to integrate functional and concurrent programming based on intuitionistic linear logic. The functional core arises from interpreting proof reduc...
227
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
226
click to vote
ICWS
2004
IEEE
15 years 8 months ago
2004
IEEE
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...