16430 search results - page 3213 / 3286 » On Computable Tree Functions |
POPL
1992
ACM
13 years 12 months ago
1992
ACM
Polymorphic record calculi have recently attracted much attention as a typed foundation for objectoriented programming. This is based on the fact that a function that selects a fi...
POPL
1989
ACM
13 years 12 months ago
1989
ACM
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
COBUILD
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. As the amount of information and communication increases dramatically new working environments must provide efficient mechanisms to maximize the benefits of these develop...
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
CASES
2007
ACM
13 years 11 months ago
2007
ACM
The last decade has witnessed the emergence of the Application Specific Instruction-set Processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user...