2152 search results - page 159 / 431 » On Automating the Calculus of Relations |
181
click to vote
LICS
2005
IEEE
16 years 11 hour ago
2005
IEEE
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η. They are based on eag...
177
click to vote
CSL
2005
Springer
15 years 12 months ago
2005
Springer
In previous work we presented a foundational calculus for spatially distributed computing based on intuitionistic modal logic. With the modalities P and Q we were able to capture t...
144
click to vote
LPAR
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Earlier we introduced Constraint Lambda Calculi which integrate constraint solving with functional programming for the simple case where the constraint solver produces no...
165
click to vote
FLOPS
2004
Springer
15 years 11 months ago
2004
Springer
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
168
click to vote
ICLP
2004
Springer
15 years 11 months ago
2004
Springer
A novel style of multi-agent system specification and deployment is described, in which familiar methods from computational logic are re-interpreted to a new context. One view of ...