Mechanizing logical relations

DOI10.1007/3-540-58027-1_18OpenAlexW1531786782MaRDI QIDQ5890057

Allen Stoughton

Publication date: 28 April 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58027-1_18

zbMATH Keywords

lambda calculuslogical relationalgorithm schemaclosure processtype frame

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

Full abstraction for the second order subset of an Algol-like language ⋮ Linear Läuchli semantics ⋮ Degrees of parallelism in the continuous type hierarchy ⋮ On the expressive power of first-order boolean functions in PCF ⋮ Definability and Full Abstraction ⋮ Relative definability of boolean functions via hypergraphs

Cites Work

• LCF considered as a programming language
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mechanizing logical relations