Sciweavers

2880 search results - page 22 / 576
» Types are calling conventions
Sort
View
FCCM
2003
IEEE
135views VLSI» more  FCCM 2003»
15 years 5 months ago
Efficient Application Representation for HASTE: Hybrid Architectures with a Single, Transformable Executable
Hybrid architectures, which are composed of a conventional processor closely coupled with reconfigurable logic, seem to combine the advantages of both types of hardware. They pres...
Benjamin A. Levine, Herman Schmit
TIC
2000
Springer
174views System Software» more  TIC 2000»
15 years 3 months ago
Alias Types for Recursive Data Structures
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
David Walker, J. Gregory Morrisett
ERCIMDL
2006
Springer
130views Education» more  ERCIMDL 2006»
15 years 3 months ago
Digital Object Prototypes: An Effective Realization of Digital Object Types
Digital Object Prototypes (DOPs) provide the DL designer with the ability to model diverse types of digital objects in a uniform manner while offering digital object type conforman...
Kostas Saidis, George Pyrounakis, Mara Nikolaidou,...
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
15 years 4 months ago
Dependently Typed Grammars
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
Kasper Brink, Stefan Holdermans, Andres Löh
PRICAI
2004
Springer
15 years 5 months ago
Power of Brute-Force Search in Strongly-Typed Inductive Functional Programming Automation
Abstract. A successful case of applying brute-force search to functional programming automation is presented and compared with a conventional genetic programming method. From the i...
Susumu Katayama