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
Linearly Ordered Topological Spaces and Weak Domain Representability
TL;DR: In this paper, it was shown that every linearly ordered topological space (LOTS) is homeomorphic to an open dense subset of a weak domain representable space, which means that weak domains representable spaces need not be Baire.
Book ChapterDOI
An Abstract Interpretation for ML Equality Kinds
TL;DR: A refinement of the Standard ML system of equality types is introduced and is proven sound and complete with respect to the existence of a computable equality.
Book ChapterDOI
On the concurrent semantics of algebraic graph grammars
Paolo Baldan,Andrea Corradini +1 more
TL;DR: A survey of some of the main technical contributions that made possible the development of a truly concurrent semantics for graph grammars, based on Winskel's style unfolding constructions as well as on suitable notions of processes.
Proceedings ArticleDOI
From algebras to programming languages
TL;DR: This paper gives an informal presentation of constructions which, when combined, enable one to construct high level programming languages from algebras or, equivalently, from collections of primitive operations on some set (e.g. from the arithmetic, vector and logical operations on the set of integers, integer vectors, and truth values).
Dissertation
Using class memory automata in algorithmic game semantics
TL;DR: This thesis aims to continue the classification of the fragments of the higher-order call-by-value language RML for which observational equivalence is decidable, and develops new variants of class memory automata that allow us to express and compare languages representing game semantic strategies.