Continuity in semantic theories of programming
DOI10.1080/01445340.2015.1054576zbMATH Open1359.68003OpenAlexW1069198966WikidataQ57680944 ScholiaQ57680944MaRDI QIDQ2963952FDOQ2963952
Authors: 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
Recommendations
History of computer science (68-03) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)
Cites Work
- Title not available (Why is that?)
- LCF considered as a programming language
- On full abstraction for PCF: I, II and III
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Time, clocks, and the ordering of events in a distributed system
- Title not available (Why is that?)
- Fully abstract models of typed \(\lambda\)-calculi
- Some Stone spaces and recursion theory
- A simple fixpoint argument without the restriction to continuity
Cited In (1)
This page was built for publication: Continuity in semantic theories of programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963952)