• Published 1998

A metric model of PCF

@inproceedings{Escard1998AMM,
  title={A metric model of PCF},
  author={Mart́ın H{\"o}tzel Escard{\'o}},
  year={1998}
}
We introduce a computationally adequate metric model of PCF, based on the fact that the category of non-expansive maps of complete bounded ultrametric spaces is cartesian closed. The model captures certain temporal aspects of higher-type computation and contains both extensional and intensional functions. We show that Scott’s model arises as its extensional collapse. The intensional aspects of the metric model are illustrated via a Gödel-number-free version of Kleene’s T -predicate. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 27 CITATIONS

A Generic Foundation for Program Improvement

VIEW 4 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Pre-Ordered Metric Spaces for Program Improvement

VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

On the semantics of intensionality and intensional recursion

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Time and games

VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Quantitative Logics for Equivalence of Effectful Programs

VIEW 1 EXCERPT
CITES BACKGROUND

A Metalanguage for Guarded Iteration

VIEW 1 EXCERPT
CITES BACKGROUND

Metric Spaces for Program Improvement

  • 2018
VIEW 2 EXCERPTS
CITES METHODS & BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Lcf considered as a programming language

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

A note on coinduction and weak bisimilarity for while programs

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Contractions in Comparing Concurrency Semantics

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Matching typed and untyped realizability

  • John Longley
  • Computer Science
  • Electr. Notes Theor. Comput. Sci.
  • 2000

A conceptual account of metric lifting. Laboratory for Foundations of Computer Science, University of Edinburgh

  • M. H. Escardó, D. Turi
  • Work in progress,
  • 1999
VIEW 1 EXCERPT

Control flow semantics

VIEW 1 EXCERPT

A Universality Theorem for PCF With Recursive Types, Parallel-Or and Exists

  • Thomas Streicher
  • Mathematics, Computer Science
  • Mathematical Structures in Computer Science
  • 1994
VIEW 2 EXCERPTS

Semantics of programming languages - structures and techniques

VIEW 1 EXCERPT

Ten Years of Concurrency Semantics, Selected Papers of the Amsterdam Concurrency Group

  • J. W. de Bakker, J.J.M.M. Rutten, editors
  • World Scientific,
  • 1992
VIEW 1 EXCERPT