1131 search results - page 93 / 227 » Logic Programming, Functional Programming, and Inductive Def... |
203
Voted
POPL
2003
ACM
16 years 26 days ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
107
click to vote
INTERSENSE
2006
ACM
15 years 6 months ago
2006
ACM
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...
ECAI
2004
Springer
15 years 6 months ago
2004
Springer
Learning general truths from the observation of simple domains and, further, learning how to use this knowledge are essential capabilities for any intelligent agent to understand ...
FLOPS
2006
Springer
15 years 4 months ago
2006
Springer
What will a definitive programming language look like? By definitive language I mean a programming language that gives good soat its level of abstraction, allowing computer science...
132
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...