Full abstraction, totality and PCF
From MaRDI portal
Publication:4237906
Recommendations
- Full abstraction for PCF
- scientific article; zbMATH DE number 1523049
- On full abstraction for PCF: I, II and III
- Full Abstraction and the Context Lemma
- Definability and full abstraction
- Full abstraction and expressive completeness for FP
- Full abstraction and the Context Lemma (preliminary report)
- Full abstraction for probabilistic PCF
- Full abstraction and limiting completeness in equational languages
- Full abstraction for polymorphic \(\pi \)-calculus
Cited in
(16)- scientific article; zbMATH DE number 1523049 (Why is no real title available?)
- Nonflatness and totality
- scientific article; zbMATH DE number 512783 (Why is no real title available?)
- On the ubiquity of certain total type structures
- scientific article; zbMATH DE number 1531371 (Why is no real title available?)
- Full abstraction and the Context Lemma (preliminary report)
- General conditions for full abstraction
- On full abstraction for PCF: I, II and III
- A universality theorem for PCF with recursive types, parallel-or and ∃
- Full abstraction for nominal Scott domains
- The sequentially realizable functionals
- Full Abstraction and the Context Lemma
- Exact real number computations relative to hereditarily total functionals.
- A categorical foundation for structured reversible flowchart languages: soundness and adequacy
- Operational domain theory and topology of sequential programming languages
- scientific article; zbMATH DE number 431771 (Why is no real title available?)
This page was built for publication: Full abstraction, totality and PCF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4237906)