156 search results - page 28 / 32 » Proving Failure in Functional Logic Programs |
100
Voted
EACL
1993
ACL Anthology
15 years 1 months ago
1993
ACL Anthology
The strategy for natural language interpretation presented in this paper implements the dynamics of context change by translating natural language texts into a meaning representat...
98
Voted
DAC
2007
ACM
16 years 1 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
130
Voted
MCMASTER
1993
15 years 4 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
133
click to vote
AOSD
2003
ACM
15 years 5 months ago
2003
ACM
Middleware technologies such as Web Services, CORBA and DCOM have been very successful in solving distributed computing problems for a large family of application domains. As midd...
ICFP
2005
ACM
16 years 12 days ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...