128 search results - page 9 / 26 » Data-driven Induction of Functional Programs |
TLCA
2009
Springer
14 years 2 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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple opt...
ACL2
2006
ACM
14 years 1 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
APLAS
2007
ACM
13 years 11 months ago
2007
ACM
Abstract. We introduce the concept of guarded saturated sets, saturated sets of strongly normalizing terms closed under folding of corecursive functions. Using this tool, we can mo...
WFLP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Traditionally, machine learning algorithms such as decision tree learners have employed attribute-value representations. From the early 80's on people have started t...