Open AccessBook
Outline of a Mathematical Theory of Computation
Reads0
Chats0
TLDR
However, Scott does realize that the approach argued for above is simply an argument for an approach that accomodates human understanding of computation and that the operational approach must not be ignored because the machines that the programs of study run on are not capable of dealing with such an abstract level of understanding.Abstract:
However, Scott does realize that the approach argued for above is simply an argument for an approach that accomodates human understanding of computation and that the operational approach must not be ignored because, as he points out, the machines that the programs of study run on are not capable of dealing with such an abstract level of understanding. That is, the computaional approach should not be abandoned because the machines that we build operate on that lower level.read more
Citations
More filters
Ideals and continuity for quantaloid-enriched categories
Min Liu,Isar Stubbe +1 more
TL;DR: For any (saturated) class Phi of presheaves, the authors define and study the Phi-continuity of Q-categories, including flat ideals, irreducible ideals, and conical ideals, which are proper generalizations of ideals in domain theory.
Posted Content
Differential Logical Relations, Part I: The Simply-Typed Case (Long Version).
TL;DR: A new form of logical relation is introduced which allows us to assign each pair of programs a quantity measuring their distance, rather than a boolean value standing for their being equivalent, and is exemplified in the simply-typed lambda-calculus.
Journal Article
Causally Simple Spacetimes and Domain Theory
TL;DR: In this paper, it is shown that it is possible to reconstruct globally hyperbolic spacetimes in a purely order theoretic manner using the causal relation J + in a special category of domains known as interval domains.
Book ChapterDOI
A First Order Logic for Logic Programming
TL;DR: Clark and Tarnlud have proposed a methodology for the specification, desing and verification of logic programs in the framework of first order logic to derive the correctness of a logic program from its own clauses and suitable induction axioma on the data.