Relational Semantics for Higher-Order Programs | Zendy

Kamal Aboul-Hosn | Zendy; Dexter Kozen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Relational Semantics for Higher-Order Programs

Author(s) -

Kamal Aboul-Hosn,

Dexter Kozen

Publication year - 2006

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-35631-2

DOI - 10.1007/11783596_5

Subject(s) - semantics (computer science) , operational semantics , computer science , programming language , well founded semantics , equivalence (formal languages) , mathematical proof , denotational semantics , context (archaeology) , action semantics , theoretical computer science , mathematics , discrete mathematics , paleontology , geometry , biology

Most previous work on the semantics of higher-order programs with local state involves complex storage modeling with pointers and memory cells, complicated categorical constructions, or reasoning in the presence of context. In this paper we show how a relatively simple relational semantics can be used to avoid these complications. We provide a natural relational semantics for a programming language with higher-order functions. The semantics is purely compositional, with all contextual considerations completely encapsulated in the state. We show several equivalence proofs using this semantics based on examples of Meyer and Sieber (1988).

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