Sciweavers

575 search results - page 10 / 115
» A Calculus for Interaction Nets
Sort
View
SOSL
1993
14 years 25 days ago
Verifying Process Algebra Proofs in Type Theory
In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typed -calculus. Inhabitants (terms) of these ty...
M. P. A. Sellink
POPL
1990
ACM
14 years 7 days ago
Concurrent Constraint Programming
Abstract. Concurrent constraint programming is a simple but powerful framework for computation based on four basic computational ideas: concurrency (multiple agents are simultaneou...
Vijay A. Saraswat, Martin C. Rinard
DEXA
2000
Springer
95views Database» more  DEXA 2000»
14 years 1 months ago
Formalizing Workflows Using the Event Calculus
The event calculus is a logic programming formalism for representing events and their effects especially in database applications. This paper presents the use of the event calculus...
Nihan Kesim Cicekli, Yakup Yildirim
TLCA
2005
Springer
14 years 2 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger
CSL
2008
Springer
13 years 10 months ago
A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
We give a graph theoretical criterion on multiplicative additive linear logic (MALL) cut-free proof structures that exactly characterizes those whose interpretation is a hypercliqu...
Paolo Tranquilli