Continuity in Semantic Theories of Programming

DOI10.1080/01445340.2015.1054576zbMath1359.68003OpenAlexW1069198966WikidataQ57680944 ScholiaQ57680944MaRDI QIDQ2963952

Felice Cardone

Publication date: 22 February 2017

Published in: History and Philosophy of Logic (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2318/1572930

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) History of computer science (68-03)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple fixpoint argument without the restriction to continuity
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• On full abstraction for PCF: I, II and III
• Some Stone spaces and recursion theory
• Time, clocks, and the ordering of events in a distributed system

This page was built for publication: Continuity in Semantic Theories of Programming