Dana S. Scott. Outline of a mathematical theory of computation. In Proceedings of the 4th Annual Princeton Conference On Information Science and Systems, pages 169--176, 1970. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Parametricity as a Notion of Uniformity in Reflexive Graphs - Dunphy (2002) (Correct)
....More interesting are settings which model PLLC where the symmetric monodial structure is not Cartesian. 7. 2 Domain Models Domains have played an important role in programming semantics for the past 30 years, dating back to Scott s modeling of typed and untyped lambda calculi with domains [Sco69, Sco70] Ordered sets arise naturally in situations where non termination is possible, where a larger element terminates (is de ned) more often than a smaller element. Having such an ordering of the elements is crucial for modeling recursion. A xed point operator is typically handled by making a ....
D. Scott. Outline of a mathematical theory of computation. In 4th Annual Princeton Conference on Information Sciences and Systems, pages 169-176, 1970.
A Partial Order on Classical and Quantum States - Bob Coecke And (2002) (Correct)
....of the discrete, and so on. And this powerful ideology, as it arises in the context of recursive functionals, is part of what the axioms of domain theory are intended to capture. But even in Scott s prelude to the subject, it is difficult to keep the imagination from wandering beyond computation [13]: Maybe it would be better to talk about information; thus, x v y means that x and y want to approximate the same entity, but y gives more information about it. This means we have to allow incomplete entities, like x, containing only partial information. In its purest interpretation, ....
D. S. Scott. Outline of a mathematical theory of computation. Technical Report PRG-2, Oxford University, November 1970.
A Partial Order on Classical and Quantum States - Bob Coecke And (2002) (Correct)
....of bipartite quantum systems using unicity of the coefficients in the Schmidt biorthogonal decomposition. However, there does not exist a similar construction for arbitrary multipartite sytems. In particular, until now, there was not even a satisfactory notion of maximal entanglement e.g. see [15]. When considering three partite qubit states for the Greenberger Horn Zeilinger state [7] GHZ : and the W state [5] there are conflicting arguments about which one is maximally entangled. The general favorite, however, is GHZ, especially in view of its maximal violation of certain types ....
D. S. Scott. Outline of a mathematical theory of computation. Technical Report PRG-2, Oxford University, November 1970.
Linear Continuation-Passing - Berdine, O'Hearn, Reddy, Thielecke (2002) (Correct)
....the presence of named labels, by itself, does not. And neither does backward jumping, which allows pieces of code to be executed many times but is di#erent in character from backtracking. The basic idea can be seen in the type used to interpret untyped callby value (cbv) # calculus. Just as Scott [30] gave a typed explanation of untyped # calculus using the domain equation = D (or, equivalently, the recursive type D.D D) we can understand linear use of continuations in terms of the domain equation where # is the type of linear functions and R is a type of results. If we were ....
Scott, D. S.: 1970, `Outline of a Mathematical Theory of Computation'. Technical Monograph PRG-2, Programming Research Group, Oxford University Computing Laboratory.
Compiler Implementation Verification and Trojan Horses.. - Goerigk, Langmaack (2000) (1 citation) (Correct)
....ned. If a source language has loops or (function) procedures, then term rewriting or copy rule semantics is employed throughout [28] Other operational styles split in natural [34] or structural [37] operational or state machine like [20] Denotational semantics has started with D. Scott s work [41], and typical compiling correctness proofs can be found in [30] The authors in [22, 32, 33] use an algebraic denotational style for clearer modular proofs, based on state transformations resp. predicate transformers. Mechanical proofs are often based on interpreter semantics, a further variant ....
D. S. Scott. Outline of a Mathematical Theory of Computation. In Proceedings of the 4th Annual Princeton Conference on Information Sciences and Systems, pages 169-176, Princeton, 1970.
Compiler Implementation Verification and Trojan Horses (Draft) - Goerigk, Langmaack (2000) (1 citation) (Correct)
....a source language has loops or (function) procedures, then term rewriting or copy rule semantics is employed throughout [42, 45] Other operational styles split in natural [55] or structural [58] operational or state machinelike [32, 33] Denotational semantics has started with D. Scott s work [65, 64], and typical compiling correctness proofs can be found in [47] The authors in [37, 63, 50, 51] use an algebraic denotational style for clearer modular proofs, based on state transformations resp. predicate transformers. Mechanical proofs are often based on interpreter semantics, a further ....
D. S. Scott. Outline of a Mathematical Theory of Computation. In Proceedings of the 4th Annual Princeton Conference on Information Sciences and Systems, pages 169-176, Princeton, 1970.
Solving Recursive Domain Equations with Enriched Categories - Wagner (1994) (17 citations) Self-citation (Scott) (Correct)
No context found.
Scott, D.S., Outline of a mathematical theory of computation, Oxford University Technical Monograph PRG-2, November 1970.
Operation Refinement for VDM-like - Specifications Bettina Buth (Correct)
No context found.
Dana S. Scott. Outline of a mathematical theory of computation. In Proceedings of the 4th Annual Princeton Conference On Information Science and Systems, pages 169--176, 1970.
Algebraic Correctness Proofs for Compiling Recursive Function .. - Indermark, Noll (2004) (Correct)
No context found.
D. Scott. Outline of a mathematical theory of computation. In Proc. Fourth Annual Princeton Conference on Information Sciences and Systems, volume 3, pages 169-- 176, 1970.
Towards a Mathematical Operational Semantics - Turi, Plotkin (1997) (53 citations) (Correct)
No context found.
D. Scott. Outline of a mathematical theory of computation. In Proc. 4th Annual Princeton Conference on Inf. Sciences and Systems, pages 169-- 176, 1970.
The Origins of Structural Operational Semantics - Plotkin (2003) (1 citation) (Correct)
No context found.
Dana S. Scott, Outline of a Mathematical Theory of Computation, Programming Research Group, Technical Monograph PRG{2, Oxford University, 1970.
The Origins of Structural Operational Semantics - Plotkin (2003) (1 citation) (Correct)
No context found.
Dana S. Scott, Outline of a Mathematical Theory of Computation, Proc. 4th. Annual Princeton Conf. on Information Sciences and Systems, pp. 169-176, 1970.
Rewriting Logic Semantics: From Language Specifications To.. - Meseguer, Rosu (2004) (Correct)
No context found.
D. Scott. Outline of a mathematical theory of computation. In Proceedings, Fourth Annual Princeton Conference on Information Sciences and Systems, pages 169--
Semantics of Name and Value Passing - Fiore, Turi (2001) (7 citations) (Correct)
No context found.
D. Scott. Outline of a mathematical theory of computation. Annual Princeton Conference on Inf. Sciences and Systems, pages 169--176, 1970.
Proof Mining in Subsystems of Analysis - Oliva (2003) (Correct)
No context found.
D. S. Scott. Outline of a mathematical theory of computation. In 4th Annual Princeton Conference on Information Sciences and Systems, pages 169--176, 1970.
Domain-theoretic Solution of Differential Equations.. - Edalat, Krznaric.. (Correct)
No context found.
D. S. Scott. Outline of a mathematical theory of computation. In 4th Annual Princeton Conference on Information Sciences and Systems, pages 169{ 176, 1970.
Domain Theory for Concurrency - Nygaard (2003) (1 citation) (Correct)
No context found.
D. S. Scott. Outline of a mathematical theory of computation. In Proc. 4th Annual Princeton Conference on Information Sciences and Systems, 1970.
Domain Theory - Corrected and expanded version - Abramsky, Jung (Correct)
No context found.
D. S. Scott. Outline of a mathematical theory of computation. In 4th Annual Princeton Conference on Information Sciences and Systems, pages 169--176, 1970. 161
Semantics-based Program Analysis via Symbolic Composition of.. - Colby (1996) (Correct)
No context found.
Dana Scott. Outline of a mathematical theory of computation. In Proceedings, Fourth Annual Princeton Conference on Information Sciences and Systems, pages 169--176. Princeton University, 1970. Also, Programming Research Group Technical Monograph PRG--2, Oxford University. (p 67)
The Early Search for Tractable Ways of Reasoning About Programs - Jones (2003) (Correct)
No context found.
D. Scott. Outline of a mathematical theory of computation. Technical Report PRG-2, Oxford University Computing Laboratory, Programming Research Group, November 1970.
Domain Theory for Concurrency - Nygaard (2003) (1 citation) (Correct)
No context found.
D. S. Scott. Outline of a mathematical theory of computation. In Proc. 4th Annual Princeton Conference on Information Sciences and Systems, 1970.
Semantic Domains for Combining Probability and Non-Determinism - Tix, Keimel, Plotkin (2005) (Correct)
No context found.
D. S. Scott. Outline of a mathematical theory of computation. In 4th Annual Princeton Conference on Information Sciences and Systems, pages 169-176, 1970.
Programming Research Group - Partial Order On (1995) (2 citations) (Correct)
No context found.
D. Scott. Outline of a mathematical theory of computation. Technical Monograph PRG-2, November 1970. 91
Swinging Data Types - The dielectic between actions and.. - Padawitz (1998) (Correct)
No context found.
D. Scott, Outline of a Mathematical Theory of Computation, Proc. Information Sciences and Systems, Princeton (1970) 169-176
Hierarchical Finite State Machines with Multiple Concurrency.. - Girault, Lee, Lee (1999) (25 citations) (Correct)
No context found.
D. Scott, "Outline of a mathematical theory of computation," in Proc. 4th Ann. Princeton Conf. Information sciences and systems, 1970, pp. 169--176.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC