Sciweavers

2152 search results - page 71 / 431
» On Automating the Calculus of Relations
Sort
View
101
Voted
IANDC
2010
125views more  IANDC 2010»
14 years 11 months ago
Continuation semantics for the Lambek-Grishin calculus
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...
Raffaella Bernardi, Michael Moortgat
TCS
2010
14 years 11 months ago
On the expressiveness of interaction
Subbisimilarity is proposed as a general tool to classify the relative expressive power of process calculi. The expressiveness of several variants of CCS is compared in terms of t...
Yuxi Fu, Hao Lu
98
Voted
LOPSTR
2004
Springer
15 years 6 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
96
Voted
FLOPS
2008
Springer
15 years 2 months ago
Typed Dynamic Control Operators for Delimited Continuations
Abstract. We study the dynamic control operators for delimited continuations, control and prompt. Based on recent developments on purely functional CPS translations for them, we in...
Yukiyoshi Kameyama, Takuo Yonezawa
81
Voted
CL
2004
Springer
15 years 15 days ago
Nesting analysis of mobile ambients
A new algorithm is introduced for analyzing possible nestings in mobile ambient calculus. It improves both time and space complexities of the technique proposed by Nielson and Sei...
Chiara Braghin, Agostino Cortesi, Riccardo Focardi...