A type-theoretical alternative to ISWIM, CUCH, OWHY

1993/12/01 by Dana Scott, Dana S. Scott · 9 citations
Computer Science · #Formal Methods in Verification #Logic, Reasoning, and Knowledge #Logic, programming, and type systems

paper · doi:10.1016/0304-3975(93)90095-b

crossref issued 1993/12/01 · crossref published 1993/12/01 · crossref published-print 1993/12/01 · crossref created 2002/07/26 · crossref deposited 2020/02/05 · crossref indexed 2026/06/06

Cited by

• FS-domains are not always RB-domains
• Definability and Full Abstraction
• Proof assistants: History, ideas and future
• On Full Abstraction for PCF: I, II, and III
• Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere
• Categorical semantics of a simple differential programming language
• Inductive Definition and Domain Theoretic Properties of Fully Abstract
• Lambda calculus [wikipedia]
• Programming Computable Functions [wikipedia]