The definition for the notion of a "function" is not cast in stone, but depends upon what we adopt as types in our language. With partial equivalence relations (pers) as types in a relational language, we show that the functional relations are precisely those satisfying the simple equation f = f o fu o f, where "o" and "u" are respectively the composition and converse operators for relations. This article forms part of "A calculational theory of pers as types"
We give the first relationally parametric model of the extensional calculus of constructions. Our mo...
AbstractGiven a specification that includes a number of user requirements, we wish to focus on the r...
Comunicação publicada em "Lecture Notes in Computer Science", vol. 7560 (2012), pag. 146-161The cal...
In the calculational approach to programming, programs are derived from specifications by algebraic ...
This article is an introduction to the use of relational calculi in deriving programs. Using the re...
This thesis is about the calculational approach to programming, in which one de-rives programs from ...
While programming in a relational framework has much to offer over the functional style in terms of ...
This thesis is about the calculational approach to programming, in which one derives programs from s...
International audienceThe logical foundations of arithmetic generally start with a quantificational ...
The notion of a difunction was introduced by Jacques Riguet in 1948. Since then it has played a prom...
Functional programmers often reason about programs as if they were written in a total language, expe...
Many functional programs can be viewed as representation changers, that is, as functions that conver...
It is commonly believed that it makes no difference whether one starts with relational types or func...
In this paper, a proof is given that in design methods, the relation between technical functions and...
Abstract. Types were invented by Russell to solve the logical paradoxes that resulted from Frege’s g...
We give the first relationally parametric model of the extensional calculus of constructions. Our mo...
AbstractGiven a specification that includes a number of user requirements, we wish to focus on the r...
Comunicação publicada em "Lecture Notes in Computer Science", vol. 7560 (2012), pag. 146-161The cal...
In the calculational approach to programming, programs are derived from specifications by algebraic ...
This article is an introduction to the use of relational calculi in deriving programs. Using the re...
This thesis is about the calculational approach to programming, in which one de-rives programs from ...
While programming in a relational framework has much to offer over the functional style in terms of ...
This thesis is about the calculational approach to programming, in which one derives programs from s...
International audienceThe logical foundations of arithmetic generally start with a quantificational ...
The notion of a difunction was introduced by Jacques Riguet in 1948. Since then it has played a prom...
Functional programmers often reason about programs as if they were written in a total language, expe...
Many functional programs can be viewed as representation changers, that is, as functions that conver...
It is commonly believed that it makes no difference whether one starts with relational types or func...
In this paper, a proof is given that in design methods, the relation between technical functions and...
Abstract. Types were invented by Russell to solve the logical paradoxes that resulted from Frege’s g...
We give the first relationally parametric model of the extensional calculus of constructions. Our mo...
AbstractGiven a specification that includes a number of user requirements, we wish to focus on the r...
Comunicação publicada em "Lecture Notes in Computer Science", vol. 7560 (2012), pag. 146-161The cal...