Full abstraction, totality and PCF
From MaRDI portal
Publication:4237906
DOI10.1017/S0960129598002692zbMath0923.68087OpenAlexW1993746530MaRDI QIDQ4237906
Publication date: 13 April 1999
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129598002692
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)
Related Items
Nonflatness and totality, On the ubiquity of certain total type structures, A categorical foundation for structured reversible flowchart languages: Soundness and adequacy, Operational domain theory and topology of sequential programming languages, The sequentially realizable functionals, Exact real number computations relative to hereditarily total functionals.
