International audienceWe derive a Hoare-Floyd logic for non-local jumps and mutable higher-order procedural variables from a formulæ-as-types notion of control for classical logic. The main contribution of this work is the design of an imperative dependent type system for non-local jumps which corresponds to classical logic but where the famous consequence rule is still derivable
This thesis examines the use of denotational semantics to reason about control flow in sequential, b...
Mainstream programming idioms intensively rely on state mutation, sharing, and concurrency. Designin...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
AbstractWe derive a Floyd–Hoare logic for non-local jumps and mutable higher-order procedural variab...
International audienceWe derive a Floyd-Hoare logic for non-local jumps and mutable higher-order pro...
50 pagesRelying on the formulae-as-types paradigm for classical logic, we define a program logic for...
We introduce a Hoare logic for call-by-value higher-order functional languages with control operator...
We introduce an extension of Hoare logic for call-by-value higher-orderfunctions with ML-like local ...
Abstract. We introduce an extension of Hoare logic for call-by-value higher-order functions with ML-...
In this paper we investigate a logic for reasoning about programs with higher-order functions and ef...
The aim of the paper is to give a general idea to state optimality conditions of control of problem ...
AbstractEarlier work has shown that a form of possible-world semantics allows elegant solutions to c...
International audienceWe first propose a nonsmooth hybrid invariance principle with relaxed conditio...
This paper presents systems for first-order intuitionistic logic and several of its extensions in wh...
International audienceDependent types are a key feature of type systems, typically used in the conte...
This thesis examines the use of denotational semantics to reason about control flow in sequential, b...
Mainstream programming idioms intensively rely on state mutation, sharing, and concurrency. Designin...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
AbstractWe derive a Floyd–Hoare logic for non-local jumps and mutable higher-order procedural variab...
International audienceWe derive a Floyd-Hoare logic for non-local jumps and mutable higher-order pro...
50 pagesRelying on the formulae-as-types paradigm for classical logic, we define a program logic for...
We introduce a Hoare logic for call-by-value higher-order functional languages with control operator...
We introduce an extension of Hoare logic for call-by-value higher-orderfunctions with ML-like local ...
Abstract. We introduce an extension of Hoare logic for call-by-value higher-order functions with ML-...
In this paper we investigate a logic for reasoning about programs with higher-order functions and ef...
The aim of the paper is to give a general idea to state optimality conditions of control of problem ...
AbstractEarlier work has shown that a form of possible-world semantics allows elegant solutions to c...
International audienceWe first propose a nonsmooth hybrid invariance principle with relaxed conditio...
This paper presents systems for first-order intuitionistic logic and several of its extensions in wh...
International audienceDependent types are a key feature of type systems, typically used in the conte...
This thesis examines the use of denotational semantics to reason about control flow in sequential, b...
Mainstream programming idioms intensively rely on state mutation, sharing, and concurrency. Designin...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
Add to ORKG