Reasoning about programs that use effects can be much harder than reasoning about their pure counterparts. This paper presents a predicate transformer semantics for a variety of effects, including exceptions, state, non-determinism, and general recursion. The predicate transformer semantics gives rise to a refinement relation that can be used to relate a program to its specification, or even calculate effectful programs that are correct by construction
In this paper we introduce a variable typed logic of effects inspired by the variable type systems o...
Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reaso...
A recent paper by Graham Hutton and Diana Fulger (\"Reasoning about Effects: Seeing the Wood through...
This paper describes how to verify a parser for regular expressions in a functional programming lang...
The invariant based programming is a technique of constructing correct programs by first identifying...
The behavior of a program can be modeled by describing how it transforms input states to output stat...
Formal techniques for specifying performance properties of programs (e.g., execution time) and for v...
AbstractThis note presents a summary of my research on reasoning about programs with effects. This w...
In the semantics of programming languages one can view programs as statetransformers, or as predicat...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
Effect handlers have recently gained popularity amongst programming language researchers. Existing t...
We develop the semantics of a language with arbitrary atomic statements, unbounded nondeterminacy, a...
Predicate transformer semantics (PTS) has proved to be very fruitful, in particular for program deri...
Abstract. This paper discusses refinement of programs that may raise and catch exceptions. We show t...
AbstractIn this paper we introduce a variable typed logic of effects inspired by the variable type s...
In this paper we introduce a variable typed logic of effects inspired by the variable type systems o...
Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reaso...
A recent paper by Graham Hutton and Diana Fulger (\"Reasoning about Effects: Seeing the Wood through...
This paper describes how to verify a parser for regular expressions in a functional programming lang...
The invariant based programming is a technique of constructing correct programs by first identifying...
The behavior of a program can be modeled by describing how it transforms input states to output stat...
Formal techniques for specifying performance properties of programs (e.g., execution time) and for v...
AbstractThis note presents a summary of my research on reasoning about programs with effects. This w...
In the semantics of programming languages one can view programs as statetransformers, or as predicat...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
Effect handlers have recently gained popularity amongst programming language researchers. Existing t...
We develop the semantics of a language with arbitrary atomic statements, unbounded nondeterminacy, a...
Predicate transformer semantics (PTS) has proved to be very fruitful, in particular for program deri...
Abstract. This paper discusses refinement of programs that may raise and catch exceptions. We show t...
AbstractIn this paper we introduce a variable typed logic of effects inspired by the variable type s...
In this paper we introduce a variable typed logic of effects inspired by the variable type systems o...
Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reaso...
A recent paper by Graham Hutton and Diana Fulger (\"Reasoning about Effects: Seeing the Wood through...
DOI
Add to ORKG