313 search results - page 58 / 63 » Formalizing the Halting Problem in a Constructive Type Theor... |
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
INFORMS
1998
13 years 7 months ago
1998
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
A recent theoretical investigation of modular representations shows that certain modularizations can introduce a distance bias into a landscape. This was a static analysis, and em...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
A common method for constructing a function from a finite set of moments is to solve a constrained minimization problem. The idea is to find, among all functions with the given ...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...