Add to ORKGInternational audienceWe derive a Floyd-Hoare logic for non-local jumps and mutable higher-order procedural variables from a formulæ-as-types notion of control for classical logic. A key contribution of this work is the design of an imperative dependent type system for Hoare triples, which corresponds to classical logic, but where the famous consequence rule is admissible. Moreover, we prove that this system is complete for a reasonable notion of validity for Hoare judgments
Hoare Type Theory (HTT) combines a dependently typed, higher-order language with monadically-encapsu...
Abstract – This paper presents a new approach to formalizing the general rules of the Hoare logic. O...
Classical Hoare triples are modified to specify and design distributed real-time systems. The assert...
AbstractWe derive a Floyd–Hoare logic for non-local jumps and mutable higher-order procedural variab...
International audienceWe derive a Hoare-Floyd logic for non-local jumps and mutable higher-order pro...
We introduce a Hoare logic for call-by-value higher-order functional languages with control operator...
50 pagesRelying on the formulae-as-types paradigm for classical logic, we define a program logic for...
We introduce an extension of Hoare logic for call-by-value higher-orderfunctions with ML-like local ...
In this paper we investigate a logic for reasoning about programs with higher-order functions and ef...
Abstract. We introduce an extension of Hoare logic for call-by-value higher-order functions with ML-...
Abstract. We present a novel Hoare-style logic, called Reverse Hoare Logic, which can be used to rea...
Continuations are programming abstractions that allow for manip-ulating the “future ” of a computati...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
Abstract. We study a propositional variant of Hoare logic that can be used for reasoning about progr...
Abstract. Hoare Type Theory (HTT) combines a dependently typed, higher-order language with monadical...
Hoare Type Theory (HTT) combines a dependently typed, higher-order language with monadically-encapsu...
Abstract – This paper presents a new approach to formalizing the general rules of the Hoare logic. O...
Classical Hoare triples are modified to specify and design distributed real-time systems. The assert...
AbstractWe derive a Floyd–Hoare logic for non-local jumps and mutable higher-order procedural variab...
International audienceWe derive a Hoare-Floyd logic for non-local jumps and mutable higher-order pro...
We introduce a Hoare logic for call-by-value higher-order functional languages with control operator...
50 pagesRelying on the formulae-as-types paradigm for classical logic, we define a program logic for...
We introduce an extension of Hoare logic for call-by-value higher-orderfunctions with ML-like local ...
In this paper we investigate a logic for reasoning about programs with higher-order functions and ef...
Abstract. We introduce an extension of Hoare logic for call-by-value higher-order functions with ML-...
Abstract. We present a novel Hoare-style logic, called Reverse Hoare Logic, which can be used to rea...
Continuations are programming abstractions that allow for manip-ulating the “future ” of a computati...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
Abstract. We study a propositional variant of Hoare logic that can be used for reasoning about progr...
Abstract. Hoare Type Theory (HTT) combines a dependently typed, higher-order language with monadical...
Hoare Type Theory (HTT) combines a dependently typed, higher-order language with monadically-encapsu...
Abstract – This paper presents a new approach to formalizing the general rules of the Hoare logic. O...
Classical Hoare triples are modified to specify and design distributed real-time systems. The assert...