8706 search results - page 1113 / 1742 » Learning Subjective Language |
188
click to vote
ICFP
2008
ACM
16 years 7 months ago
2008
ACM
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
223
click to vote
ICFP
2007
ACM
16 years 7 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
195
click to vote
ICFP
2006
ACM
16 years 7 months ago
2006
ACM
d abstract) Keiko Nakata1 Jacques Garrigue2 1 Kyoto University Research Institute for Mathematical Sciences 2 Graduate School of Mathematics, Nagoya University The ML module syste...
194
click to vote
ICFP
2005
ACM
16 years 7 months ago
2005
ACM
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
205
click to vote
ICFP
2005
ACM
16 years 7 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...