3299 search results - page 57 / 660 » A general mathematics of names |
107
click to vote
BMCBI
2007
14 years 12 months ago
2007
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
192
click to vote
POPL
2007
ACM
16 years 5 days ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
100
click to vote
VSTTE
2005
Springer
15 years 5 months ago
2005
Springer
We formulate some research and development challenges that relate what a verifying compiler can verify to the definition and analysis of the application-content of programs, where...
101
click to vote
ADG
1998
Springer
15 years 4 months ago
1998
Springer
This paper reviews and evaluates three main techniques for automated geometry diagram construction: synthetic methods, numerical computation methods, and symbolic computation metho...
109
click to vote
MPC
1995
Springer
15 years 3 months ago
1995
Springer
Abstract. This paper is about exceptions handling using classical techniques of program extraction. We propose an impredicative formalization in the calculus of constructions and w...