scientific article; zbMATH DE number 512783

MaRDI QIDQ4281476zbMATH OpenFDO

Authors Achim Jung, Allen Stoughton

Publication date 2 June 1994

zbMATH Keywords

continuous function modeltyped lambda calculus

Mathematics Subject Classification ID

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

Recommendations

• Full abstraction for PCF
• On full abstraction for PCF: I, II and III
• Full abstraction, totality and PCF
• Computer Science Logic
• Full abstraction for probabilistic PCF
• scientific article; zbMATH DE number 176723
• An abstract analogon of the de Branges-Rovnyak functional model
• Inductive Definition and Domain Theoretic Properties of Fully Abstract
• Applications of pcf theory
• Models of computation for partial functions on the reals

Cited in

(6)

• Full abstraction for the second order subset of an Algol-like language
• Full abstraction for PCF
• A relational account of call-by-value sequentiality
• The variable containment problem
• Mechanizing logical relations
• Finitary PCF is not decidable

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281476)