Sciweavers

1932 search results - page 162 / 387
» A Functional Quantum Programming Language
Sort
View
ICFP
2008
ACM
16 years 6 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
POPL
2006
ACM
16 years 6 months ago
Modular set-based analysis from contracts
In PLT Scheme, programs consist of modules with contracts. The latter describe the inputs and outputs of functions and objects via predicates. A run-time system enforces these pre...
Philippe Meunier, Robert Bruce Findler, Matthias F...
SAC
2009
ACM
16 years 1 months ago
Celling SHIM: compiling deterministic concurrency to a heterogeneous multicore
Parallel architectures are the way of the future, but are notoriously difficult to program. In addition to the low-level constructs they often present (e.g., locks, DMA, and non-...
Nalini Vasudevan, Stephen A. Edwards
GCSE
1999
Springer
15 years 10 months ago
Scoping Constructs for Software Generators
Abstract. A well-known problem in program generation is scoping. When identifiers (i.e., symbolic names) are used to refer to variables, types, or functions, program generators mu...
Yannis Smaragdakis, Don S. Batory
AOSD
2007
ACM
15 years 10 months ago
Generating parallel applications for distributed memory systems using aspects, components, and patterns
Developing and debugging parallel programs particularly for distributed memory architectures is still a difficult task. The most popular approach to developing parallel programs f...
Purushotham V. Bangalore