Sciweavers

1228 search results - page 3 / 246
» Continuations, proofs and tests
Sort
View
TLCA
1993
Springer
13 years 10 months ago
Program Extraction from Normalization Proofs
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
Ulrich Berger
MST
2008
101views more  MST 2008»
13 years 6 months ago
Realizability interpretation of proofs in constructive analysis
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...
Helmut Schwichtenberg
LICS
2012
IEEE
11 years 8 months ago
The Complete Proof Theory of Hybrid Systems
—Hybrid systems are a fusion of continuous dynamical systems and discrete dynamical systems. They freely combine dynamical features from both worlds. For that reason, it has ofte...
André Platzer
ESOP
2000
Springer
13 years 9 months ago
Formalizing Implementation Strategies for First-Class Continuations
Abstract. We present the first formalization of implementation straor first-class continuations. The formalization hinges on abstract machines for continuation-passing style (CPS) ...
Olivier Danvy
GECCO
2009
Springer
129views Optimization» more  GECCO 2009»
13 years 9 months ago
Evolutionary functional testing of continuous control systems
Evolutionary functional testing is an approach to automatically generating test cases that violate a certain functional system requirement. This paper proposes an approach suitabl...
Andreas Windisch, Felix Lindlar, Sebastian Topuz, ...