scientific article; zbMATH DE number 1183237

zbMATH Open0902.68026MaRDI QIDQ3837985FDOQ3837985

Authors: Torben Braüner 

Publication date: 10 December 1998

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2185709
• Publication:4490356
• Full abstraction for PCF
• scientific article; zbMATH DE number 3976319

zbMATH Keywords

PCFcategorical model

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Computational adequacy for recursive types in models of intuitionistic set theory
• On classical PCF, linear logic and the MIX rule
• The Scott model of PCF in univalent type theory
• Title not available (Why is that?)

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 Q3837985)