2152 search results - page 159 / 431 » On Automating the Calculus of Relations |
201
click to vote
LICS
2005
IEEE
16 years 19 days 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...
196
click to vote
CSL
2005
Springer
16 years 18 days 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...
164
click to vote
LPAR
2005
Springer
16 years 17 days 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...
186
click to vote
FLOPS
2004
Springer
16 years 14 days 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...
194
click to vote
ICLP
2004
Springer
16 years 13 days 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 ...