220 search results - page 17 / 44 » Linear-Time Hierarchies for a Functional Language Machine Mo... |
LREC
2010
13 years 8 months ago
2010
Automatically translating natural language into machine-readable instructions is one of major interesting and challenging tasks in Natural Language (NL) Processing. This problem c...
APLAS
2006
ACM
14 years 1 months ago
2006
ACM
XML transformations are most naturally defined as recursive functions on trees. Their direct implementation, however, causes inefficient memory usage because the input XML tree is...
ECOOPW
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. In Aspect-Oriented Programming we decompose a problem into a number of functional components as well as a number of aspects and then we compose these components and aspec...
COCO
2010
Springer
13 years 9 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
COLT
2003
Springer
14 years 18 days ago
2003
Springer
Sublearning, a model for learning of subconcepts of a concept, is presented. Sublearning a class of total recursive functions informally means to learn all functions from that cla...