89 search results - page 7 / 18 » A Resolution Calculus for Dynamic Semantics |
TGC
2005
Springer
14 years 1 months ago
2005
Springer
Dynamic rebinding is the ability of changing the definitions of names at execution time. While dynamic rebinding is clearly useful in practice, and increasingly needed in modern s...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
Virtual classes are class-valued attributes of objects. Like virtual methods, virtual classes are defined in an object's class and may be redefined within subclasses. They re...
COLING
2010
13 years 2 months ago
2010
This paper proposes a dependency-driven scheme to dynamically determine the syntactic parse tree structure for tree kernel-based anaphoricity determination in coreference resoluti...
ESOP
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
TGC
2005
Springer
14 years 1 months ago
2005
Springer
We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of...