Fully abstract translations between functional languages

DOI10.1017/S0960129500000293zbMath0802.68023OpenAlexW2087165885MaRDI QIDQ4286526

Jon G. Riecke

Publication date: 11 December 1994

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129500000293

zbMATH Keywords

full abstractioncode equivalencefunctional translationprogramming language for computable functionsabstract translations between programming languagescall-by-value PCFlazy PCF

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items (2)

A relational account of call-by-value sequentiality ⋮ The sequentially realizable functionals

Cites Work

• Unnamed Item
• Expressibility of functionals in D. Scott's LCF language
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• The typed lambda-calculus is not elementary recursive
• Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus
• Logical relations and the typed λ-calculus

This page was built for publication: Fully abstract translations between functional languages