Bi-inductive Structural Semantics | Zendy

Patrick Cousot | Zendy; Radhia Cousot | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Bi-inductive Structural Semantics

Author(s) -

Patrick Cousot,

Radhia Cousot

Publication year - 2007

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2007.08.015

Subject(s) - generalization , trace (psycholinguistics) , operational semantics , semantics (computer science) , abstraction , inductive bias , kripke semantics , computer science , set (abstract data type) , simple (philosophy) , programming language , theoretical computer science , algebra over a field , mathematics , pure mathematics , mathematical analysis , philosophy , linguistics , multi task learning , management , epistemology , intermediate logic , economics , description logic , task (project management)

We propose a simple order-theoretic generalization of set-theoretic inductive definitions. This generalization covers inductive, co-inductive and bi-inductive definitions and is preserved by abstraction. This allows the structural operational semantics to describe simultaneously the finite/terminating and infinite/diverging behaviors of programs. This is illustrated on the structural bifinitary small/big-step trace/relational/operational semantics of the call-by-value λ-calculus

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