On Proving Limiting Completeness

DOI10.1137/0216015MaRDI QIDQ3769943zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Peter D. Mosses, Gordon D. Plotkin

Publication date 1987

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0216015

zbMATH Keywords

approximation theoremcorrespondences between denotational and operational semanticsintermediate semanticslambda calculusrecursively-specified inclusive relations

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• scientific article; zbMATH DE number 794258
• Completeness of transfinite evaluation in an extension of the lambda calculus
• Typed Lambda Calculi and Applications
• scientific article; zbMATH DE number 883584

Cited in

(4)

• On the approximation of denotational mu-semantics
• Lambda galore
• Logical Relations for PCF
• Type inference with recursive types: Syntax and semantics

This page was built for publication: On Proving Limiting Completeness

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