On Proving Limiting Completeness

DOI10.1137/0216015zbMath0632.68012OpenAlexW2048570681WikidataQ57783652 ScholiaQ57783652MaRDI QIDQ3769943

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

lambda calculusapproximation theoremcorrespondences between denotational and operational semanticsintermediate semanticsrecursively-specified inclusive relations

Mathematics Subject Classification ID

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

Related Items

Type inference with recursive types: Syntax and semantics