194 search results - page 5 / 39 » A Rewriting Semantics for Type Inference |
RTA
2004
Springer
14 years 21 days ago
2004
Springer
Over the past decade, researchers have found context-sensitive term-rewriting semantics to be powerful and expressive tools for modeling programming languages, particularly in esta...
AAAI
2007
13 years 9 months ago
2007
Semantic inference is an important component in many natural language understanding applications. Classical approaches to semantic inference rely on complex logical representation...
ACL
1994
13 years 8 months ago
1994
It is claimed that a variety of facts concerning ellipsis, event reference, and interclausal coherence can be explained by two features of the linguistic form in question: (1) whe...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...
ENTCS
2007
13 years 7 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...