557 search results - page 99 / 112 » Calculi for Service-Oriented Computing |
CONCUR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it po...
107
Voted
FUIN
2006
15 years 1 months ago
2006
This work is a continuation of the investigations aiming to bridge membrane computing (where in a compartmental cell-like structure the chemicals to evolve are placed in the compar...
101
click to vote
FOSSACS
2010
Springer
15 years 8 months ago
2010
Springer
Λµ-calculus was introduced as a Böhm-complete extension of Parigot's λµ-calculus. Λµ-calculus, contrarily to Parigot's calculus, is a calculus of CBN delimited con...
125
Voted
LICS
2008
IEEE
15 years 8 months ago
2008
IEEE
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
117
click to vote
LICS
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...