Sciweavers

5415 search results - page 352 / 1083
» The Implementation of Functional Programming Languages
Sort
View
ICML
1989
IEEE
15 years 10 months ago
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
Scott Dietzen, Frank Pfenning
DLS
2007
150views Languages» more  DLS 2007»
15 years 10 months ago
RPython: a step towards reconciling dynamically and statically typed OO languages
Although the C-based interpreter of Python is reasonably fast, implementations on the CLI or the JVM platforms offers some advantages in terms of robustness and interoperability. ...
Davide Ancona, Massimo Ancona, Antonio Cuni, Nicho...
SFP
2004
15 years 8 months ago
Generic proofs for combinator-based generic programs
Abstract: Generic programming can bring important benefits to software engineering. In particular, it reduces the burden of verification, since generic proofs can be instantiated a...
Fermín Reig
ICALP
2003
Springer
15 years 12 months ago
Sophistication Revisited
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
Luis Antunes 0002, Lance Fortnow
ISHPC
1997
Springer
15 years 11 months ago
Implementing Iterative Solvers for Irregular Sparse Matrix Problems in High Performance Fortran
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
Eric de Sturler, Damian Loher