3238 search results - page 253 / 648 » On the Computational Interpretation of Negation |
177
click to vote
ICTCS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We consider a call-by-value language, with higher-order functions, records, references to values of arbitrary type, and subtyping. We adapt an intrinsic denotational mode...
155
click to vote
WIA
2005
Springer
16 years 4 days ago
2005
Springer
The paper introduces a robust spelling correction technique to deal with ill-formed input strings, including unknown parts of unknown length. In contrast to previous works, we deri...
164
click to vote
SIGSOFT
2004
ACM
16 years 2 days ago
2004
ACM
A type system for object models is described that supports subtypes and allows overloading of relation names. No special features need be added to the modelling language; in parti...
136
click to vote
CONCUR
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. We study the expressiveness of finite message-passing automata with a priori unbounded FIFO channels and show them to capture exactly the class of MSC languages that are...
167
click to vote
ICALP
2004
Springer
16 years 1 days ago
2004
Springer
We consider the multiplicative and exponential fragment of linear logic (MELL) and give a Geometry of Interaction (GoI) semantics for it based on unique decomposition categories. ...