On Full Abstraction for PCF: I, II, and III

2000/12/01 by J. M. E. Hyland, J.M.E. Hyland, C.-H. Luke Ong +1 · 4 citations
Computer Science · Mathematics · #Abstraction #Art #Computer science #Conversation #Epistemology #Linguistics #Literature #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Mathematical economics #Mathematics #Multi-Agent Systems and Negotiation #Order (exchange) #Philosophy #Point (geometry) #Programming language #Recursion (computer science) #Style (visual arts) #Type (biology)

paper · doi:10.1006/inco.2000.2917

crossref issued 2000/12/01 · crossref published 2000/12/01 · crossref published-print 2000/12/01 · openalex publication_date 2000/12/01 · crossref created 2002/09/17 · crossref deposited 2019/05/08 · openalex created_date 2025/10/10 · crossref indexed 2026/06/19 · openalex updated_date 2026/06/21

Citations

• Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes
• A new characterization of lambda definability
• Hereditarily sequential functionals
• A formulation of the simple theory of types
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• Fundamental Concepts in Programming Languages
• Intensional interpretations of functionals of finite type I

Cited by

• Finitary PCF is not decidable
• Game-theoretic Interpretation of Intuitionistic Type Theory
• Combinatorial structure of type dependency
• Fully-abstract concurrent games for pi
• Programming Computable Functions [wikipedia]