AbstractWe define the class of relational graph models and study the induced order- and equational- theories. Using the Taylor expansion, we show that all λ-terms with the same Böhm tree are equated in any relational graph model. If the model is moreover extensional and satisfies a technical condition, then its order-theory coincides with Morris's observational pre-order. Finally, we introduce an extensional version of the Taylor expansion, then prove that two λ-terms have the same extensional Taylor expansion exactly when they are equivalent in Morris's sense
The relational model is the most commonly used data model for storing large datasets, perhaps due to...
Relational models for contingency tables are generalizations of log-linear models, allowing effects ...
AbstractWe develop a slight modification of Engeler's graph algebras, yielding extensional combinato...
International audienceWe define the class of relational graph models and study the induced order-and...
This thesis is a contribution to the study of Church’s untyped λ-calculus, a term rewritingsystem h...
International audienceWorking in the untyped lambda calculus, we study Morris's λ-theory H +. Introd...
We study the relational graph models that constitute a natural subclass ofrelational models of lambd...
We proved recently that the extensional collapse of the relational model of linear logic coincides w...
International audienceWe show that: (1) the Taylor expansion of a cut-free MELL proof-structure R wi...
We show how and why it makes sense to use a relational formalisation instead of the usual functional...
We consider a simple model of higher order, functional computation over the booleans. Then, we enric...
AbstractWe show that the extensional collapse of the relational model of linear logic is the model o...
The speculative ambition of replacing the old theory of program approximation based on syntactic con...
AbstractWe generalize Baeten and Boerboom's method of forcing to show that there is a fixed sequence...
26 pagesInternational audienceWe show that the extensional collapse of the relational model of linea...
The relational model is the most commonly used data model for storing large datasets, perhaps due to...
Relational models for contingency tables are generalizations of log-linear models, allowing effects ...
AbstractWe develop a slight modification of Engeler's graph algebras, yielding extensional combinato...
International audienceWe define the class of relational graph models and study the induced order-and...
This thesis is a contribution to the study of Church’s untyped λ-calculus, a term rewritingsystem h...
International audienceWorking in the untyped lambda calculus, we study Morris's λ-theory H +. Introd...
We study the relational graph models that constitute a natural subclass ofrelational models of lambd...
We proved recently that the extensional collapse of the relational model of linear logic coincides w...
International audienceWe show that: (1) the Taylor expansion of a cut-free MELL proof-structure R wi...
We show how and why it makes sense to use a relational formalisation instead of the usual functional...
We consider a simple model of higher order, functional computation over the booleans. Then, we enric...
AbstractWe show that the extensional collapse of the relational model of linear logic is the model o...
The speculative ambition of replacing the old theory of program approximation based on syntactic con...
AbstractWe generalize Baeten and Boerboom's method of forcing to show that there is a fixed sequence...
26 pagesInternational audienceWe show that the extensional collapse of the relational model of linea...
The relational model is the most commonly used data model for storing large datasets, perhaps due to...
Relational models for contingency tables are generalizations of log-linear models, allowing effects ...
AbstractWe develop a slight modification of Engeler's graph algebras, yielding extensional combinato...