564 search results - page 70 / 113 » Dependent types and program equivalence |
ICONIP
2007
13 years 10 months ago
2007
We proposed a neural segmentation model that is suitable for implementation in analog VLSIs using conventional CMOS technology. The model consists of neural oscillators mutually co...
AUTOMATICA
2007
13 years 9 months ago
2007
Stability in presence of bounded uncertain time-varying delays in the feedback loop of a system is studied. The delay parameter is assumed to be an unknown time-varying function f...
JAPLL
2010
13 years 3 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
ICFP
2012
ACM
11 years 11 months ago
2012
ACM
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...