18 search results - page 1 / 4 » From structures and functors to modules and units |
79
Voted
ICFP
2006
ACM
16 years 11 days ago
2006
ACM
t programming techniques encourage abstraction and reuse through external linking. Some parts of a program, however, must use concrete, internally specified references, so a pure ...
95
Voted
ENTCS
2008
15 years 15 days ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
100
Voted
ICFP
2006
ACM
16 years 11 days 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...
138
click to vote
ICFP
2006
ACM
16 years 11 days ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
78
Voted
IJCAI
1989
15 years 1 months ago
1989
This paper presents and compares results for three types of connectionist networks on perceptual learning tasks: [A] Multi-layered converging networks of neuron-like units, with e...