Add to ORKGInternational audienceEvaluation of a weak calculus featuring expressive pattern matching mechanisms is investigated by means of the construction of an efficient model of sharing. The sharing theory and its graph implementation are based on a labelling system derived from an analysis of causality relations between evaluation steps. The labelled calculus enjoys properties of confluence and finite developments, and is also used for proving correctness and optimality of a whole set of reduction strategies
AbstractOne of the most popular abstract domains used for the analysis of logic programs is the doma...
In this thesis, we build on a model introduced by Mark Broom and Chris Cannings in 2013. A group of ...
We face the problem of devising optimal unification operators for domains of abstract substitutions...
Evaluation of a weak calculus featuring expressive pattern matching mechanisms is investigated by me...
International audienceConcurrent Pattern Calculus (CPC) is a minimal calculus whose communication me...
International audienceConcurrent pattern calculus drives interaction between processes by unifying p...
Sharing graphs are the structures introduced by Lamping for the implementation of optimal reductions...
AbstractSharing graphs are the structures introduced by Lamping for the implementation of optimal re...
International audienceSharing graphs are a local and asynchronous implementation of lambda-calculus ...
International audienceDifferent pattern calculi integrate the functional mechanisms from the lambda-...
In this paper, we present recent work carried on μ Klaim, a core calculus that retains most of the f...
Concurrent pattern calculus drives interaction between processes by unifying patterns, just as seque...
AbstractLamping's optimal graph reduction technique for the λ-calculus is generalized to a new class...
The Pure Pattern Calculus (PPC) [10, 11] extends the λ-calculus, as well as the family of algebraic ...
The paper discusses, in a categorical perspective, some recent works on optimal graph reduction tech...
AbstractOne of the most popular abstract domains used for the analysis of logic programs is the doma...
In this thesis, we build on a model introduced by Mark Broom and Chris Cannings in 2013. A group of ...
We face the problem of devising optimal unification operators for domains of abstract substitutions...
Evaluation of a weak calculus featuring expressive pattern matching mechanisms is investigated by me...
International audienceConcurrent Pattern Calculus (CPC) is a minimal calculus whose communication me...
International audienceConcurrent pattern calculus drives interaction between processes by unifying p...
Sharing graphs are the structures introduced by Lamping for the implementation of optimal reductions...
AbstractSharing graphs are the structures introduced by Lamping for the implementation of optimal re...
International audienceSharing graphs are a local and asynchronous implementation of lambda-calculus ...
International audienceDifferent pattern calculi integrate the functional mechanisms from the lambda-...
In this paper, we present recent work carried on μ Klaim, a core calculus that retains most of the f...
Concurrent pattern calculus drives interaction between processes by unifying patterns, just as seque...
AbstractLamping's optimal graph reduction technique for the λ-calculus is generalized to a new class...
The Pure Pattern Calculus (PPC) [10, 11] extends the λ-calculus, as well as the family of algebraic ...
The paper discusses, in a categorical perspective, some recent works on optimal graph reduction tech...
AbstractOne of the most popular abstract domains used for the analysis of logic programs is the doma...
In this thesis, we build on a model introduced by Mark Broom and Chris Cannings in 2013. A group of ...
We face the problem of devising optimal unification operators for domains of abstract substitutions...