Constraint automata and the complexity of recursive subtype entailment | Zendy

Fritz Henglein | Zendy; Jakob Rehof | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Constraint automata and the complexity of recursive subtype entailment

Author(s) -

Fritz Henglein,

Jakob Rehof

Publication year - 1998

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-64781-3

DOI - 10.1007/bfb0055089

Subject(s) - logical consequence , subtyping , constraint (computer aided design) , mathematics , discrete mathematics , set (abstract data type) , tree (set theory) , combinatorics , theoretical computer science , computer science , algorithm , artificial intelligence , programming language , geometry

. We study entailment of structural and nonstructural recursivesubtyping constraints. Constraints are formal inequalities betweentype expressions, interpreted over an ordered set of possibly infinite labeledtrees. The nonstructural ordering on trees is the one introducedby Amadio and Cardelli for subtyping with recursive types. The structuralordering compares only trees with common shape. A constraintset entails an inequality if every assignment of meanings (trees) to typeexpressions...

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