Optimality for dynamic patterns | Zendy

Thibaut Balabonski | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Optimality for dynamic patterns

Author(s) -

Thibaut Balabonski

Publication year - 2010

Publication title -

hal (le centre pour la communication scientifique directe)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.1145/1836089.1836119

Subject(s) - correctness , computer science , confluence , matching (statistics) , reduction (mathematics) , theoretical computer science , graph , set (abstract data type) , pi calculus , pattern matching , causality (physics) , graph theory , algorithm , mathematics , artificial intelligence , programming language , combinatorics , statistics , geometry , physics , quantum mechanics

Evaluation 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research