Sciweavers

5377 search results - page 505 / 1076
» Programming Languages For Interactive Computing
Sort
View
CSL
2010
Springer
15 years 8 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
PLDI
2000
ACM
15 years 11 months ago
Off-line variable substitution for scaling points-to analysis
Most compiler optimizations and software productivity tools rely on information about the effects of pointer dereferences in a program. The purpose of points-to analysis is to com...
Atanas Rountev, Satish Chandra
ICFP
1999
ACM
15 years 11 months ago
A Simple Proof Technique for Certain Parametricity Results
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
Karl Crary
199
Voted
ECOOP
1993
Springer
15 years 11 months ago
Type Inference of SELF
Abstract. We have designed and implemented a type inference algorithm for the Self language. The algorithm can guarantee the safety and disambiguity of message sends, and provide u...
Ole Agesen, Jens Palsberg, Michael I. Schwartzbach
197
Voted
PC
2006
103views Management» more  PC 2006»
15 years 7 months ago
Is MPI suitable for a generative design-pattern system?
Generative parallel design patterns is a proven technique to improve the productivity of parallel program development. However many of the generative design-pattern systems are de...
Paras Mehta, José Nelson Amaral, Duane Szaf...