596 search results - page 93 / 120 » Subtyping Recursive Types |
100
click to vote
TLCA
2009
Springer
15 years 7 months ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
114
click to vote
COLT
2004
Springer
15 years 6 months ago
2004
Springer
Different formal learning models address different aspects of human learning. Below we compare Gold-style learning—interpreting learning as a limiting process in which the lear...
KR
1992
Springer
15 years 5 months ago
1992
Springer
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
125
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
106
Voted
ENTCS
2007
15 years 1 months ago
2007
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/Oexamples). Potential applications for automatic program or algorithm induct...