194 search results - page 37 / 39 » A Rewriting Semantics for Type Inference |
142
click to vote
CN
1999
15 years 2 months ago
1999
The paper argues for the use of general and intuitive knowledge representation languages (and simpler notational variants, e.g. subsets of natural languages) for indexing the cont...
145
click to vote
FDL
2006
IEEE
15 years 9 months ago
2006
IEEE
Reusing IP-cores to construct system models facilitated by automated generation of glue-logic, and automated composability checks can help designers to create efficient simulation...
252
Voted
PLDI
2009
ACM
16 years 3 months ago
2009
ACM
As computer systems continue to become more powerful and comdo programs. High-level abstractions introduced to deal with complexity in large programs, while simplifying human reas...
139
click to vote
ILP
2005
Springer
15 years 8 months ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
143
click to vote
GI
1997
Springer
15 years 7 months ago
1997
Springer
Object-Gofer is a small, practical extension of the functional programming language Gofer incorporating the following ideas from the object-oriented community: objects and toplevel...