1763 search results - page 120 / 353 » A Formalization of Polytime Functions |
105
Voted
MST
2008
15 years 3 months ago
2008
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
145
Voted
JANCL
2002
15 years 3 months ago
2002
A topological constraint language is a formal language whose variables range over certain subsets of topological spaces, and whose nonlogical primitives are interpreted as topologi...
137
Voted
SAS
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
136
click to vote
LPAR
1999
Springer
15 years 8 months ago
1999
Springer
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
139
click to vote
POPL
1998
ACM
15 years 8 months ago
1998
ACM
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...