Sciweavers

193 search results - page 37 / 39
» A Sequent Calculus for Type Theory
Sort
View
ATAL
2005
Springer
14 years 1 months ago
Formalization of a voting protocol for virtual organizations
A voting protocol for decision-making in virtual organizations is presented. In an agent-based virtual organization the functions of formation, management and dissolution of the o...
Jeremy V. Pitt, Lloyd Kamara, Marek J. Sergot, Ale...
ENTCS
2007
126views more  ENTCS 2007»
13 years 8 months ago
Modelling Calculi with Name Mobility using Graphs with Equivalences
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
ENTCS
2007
98views more  ENTCS 2007»
13 years 8 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow
ICFP
2009
ACM
14 years 9 months ago
Causal commutative arrows and their optimization
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
Hai Liu, Eric Cheng, Paul Hudak
ICFP
2005
ACM
14 years 8 months ago
A step-indexed model of substructural state
The concept of a "unique" object arises in many emerging programming languages such as Clean, CQual, Cyclone, TAL, and Vault. In each of these systems, unique objects ma...
Amal J. Ahmed, Matthew Fluet, Greg Morrisett