Full abstraction for the second order subset of an Algol-like language

DOI10.1016/S0304-3975(96)00066-7zbMath0888.68027MaRDI QIDQ1369235

Kurt Sieber

Publication date: 19 October 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

denotational semanticsALGOL-like language

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items

A fibrational framework for possible-world semantics of \textsc{Algol}-like languages

Uses Software

• ML
• ALGOL 60

Cites Work

• Semantical analysis of specification logic
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• Kripke logical relations and PCF
• On the power of list iteration
• The denotational semantics of programming languages
• A Powerdomain Construction
• Parametricity and local variables
• Correspondence between ALGOL 60 and Church's Lambda-notation
• Mechanizing logical relations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item