1888 search results - page 72 / 378 » Proof theory and computational analysis |
140
click to vote
FOSSACS
2004
Springer
15 years 11 months ago
2004
Springer
We introduce a computational interpretation for Hilbert’s choice operator (ε). This interpretation yields a typed foundation for dynamic linking in software systems. The use of ...
169
click to vote
GECCO
2007
Springer
16 years 13 days ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
163
click to vote
GI
2001
Springer
15 years 10 months ago
2001
Springer
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
141
click to vote
DIAGRAMS
2000
Springer
15 years 10 months ago
2000
Springer
This paper gives a brief overview of FG, a formal system for doing Euclidean geometry whose basic syntactic elements are geometric diagrams, and which has been implimentented as th...
159
click to vote
TLCA
2009
Springer
16 years 25 days ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...