680 search results - page 129 / 136 » Types for the Ambient Calculus |
LICS
1994
IEEE
13 years 11 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
REST
2010
ACM
13 years 9 months ago
2010
ACM
In this article a formal model applying REST architectural principles to the description of semantic web services is introduced, including the discussion of its syntax and operati...
FUIN
2006
13 years 7 months ago
2006
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., vi...
ENTCS
2007
13 years 7 months ago
2007
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...
ENTCS
2007
13 years 7 months ago
2007
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 ...