Comparative Metric Semantics of Programming Languages

[1]  Marcello M. Bonsangue,et al.  Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding , 1995, Theor. Comput. Sci..

[2]  Ralph Kopperman,et al.  Continuity Spaces: Reconciling Domains and Metric Spaces , 1997, Theor. Comput. Sci..

[3]  Ernst-Rüdiger Olderog,et al.  Verification of Sequential and Concurrent Programs , 1997, Graduate Texts in Computer Science.

[4]  Jan J. M. M. Rutten,et al.  Elements of Generalized Ultrametric Domain Theory , 1996, Theor. Comput. Sci..

[5]  I. Stark,et al.  A fully abstract domain model for the /spl pi/-calculus , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[6]  Joseph A. Goguen,et al.  Algebraic semantics of imperative programs , 1996, Foundations of computing series.

[7]  E. Moggi,et al.  A fully-abstract model for the /spl pi/-calculus , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[8]  Matthew Hennessy,et al.  Towards a Semantic Theory of CML (Extended Abstract) , 1995, MFCS.

[9]  Paolo Baldan,et al.  A Fixed-Point Theorem in a Category of Compact Metric Spaces , 1995, Theor. Comput. Sci..

[10]  Michael W. Mislove,et al.  All Compact Hausdorff Lambda Models are Degenerate , 1995, Fundam. Informaticae.

[11]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[12]  Bent Thomsen.  A Theory of Higher Order Communicating Systems , 1995, Inf. Comput..

[13]  Jan J. M. M. Rutten,et al.  Fully Abstract Denotational Models for Nonuniform Concurrent Languages , 1994, Inf. Comput..

[14]  Furio Honsell,et al.  Processes and Hyperuniverses , 1994, MFCS.

[15]  Kim R. Wagner,et al.  Solving Recursive Domain Equations with Enriched Categories. , 1994 .

[16]  Franck van Breugel,et al.  Solving Domain Equations in a Category of Compact Metric Spaces. , 1994 .

[17]  Mila E. Majster-Cederbaum,et al.  The Comparison of a CPO-based Semantics with a CMS-based semantics for CSP , 1994, Theor. Comput. Sci..

[18]  Michael Barr,et al.  Additions and Corrections to "Terminal Coalgebras in Well-founded Set Theory" , 1994, Theor. Comput. Sci..

[19]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[20]  Liang Chen.  Axiomatising Real-Time Processes , 1993, MFPS.

[21]  Frits W. Vaandrager,et al.  Expressiveness results for process algebras , 1993 .

[22]  E. Horita,et al.  Fully abstract models for concurrent languages , 1993 .

[23]  Abbas Edalat,et al.  Compact Metric Information Systems (Extended Abstract) , 1992, REX Workshop.

[24]  Mats Daniels,et al.  Modelling Real-Time Behaviour with an Interval Time Calculus , 1992, FTRTFT.

[25]  Jan J. M. M. Rutten,et al.  A semantic approach to fairness , 1992, Fundam. Informaticae.

[26]  Jan J. M. M. Rutten.  Processes as Terms: Non-Well-Founded Models for Bisimulation , 1992, Math. Struct. Comput. Sci..

[27]  Anton Eliëns,et al.  Dlp - A Language for Distributed Logic Programming: Design, Semantics and Implementation , 1992 .

[28]  Andrew W. Appel,et al.  Compiling with Continuations , 1991 .

[29]  J. W. de Bakker,et al.  Comparative Semantics for Flow of Control in Logic Programming without Logic , 1991, Inf. Comput..

[30]  A. Steven Klusener.  Completeness in Real Time Process Algebra , 1991, CONCUR.

[31]  Frank S. de Boer,et al.  The Failure of Failures in a Paradigm for Asynchronous Communication , 1991, CONCUR.

[32]  Samson Abramsky,et al.  A Domain Equation for Bisimulation , 1991, Inf. Comput..

[33]  Philippe Darondeau,et al.  On Guarded Recursion , 1991, Theor. Comput. Sci..

[34]  Viggo Stoltenberg-Hansen,et al.  Algebraic and Fixed Point Equations over Inverse Limits of Algebras , 1991, Theor. Comput. Sci..

[35]  Niklaus Wirth,et al.  Pascal User Manual and Report , 1991, Springer New York.

[36]  Joost N. Kok,et al.  Comparative Metric Semantics for Concurrent Prolog , 1990, Theor. Comput. Sci..

[37]  Bent Thomsen,et al.  Calculi for higher order communicating systems , 1990 .

[38]  Robin Milner,et al.  Definition of standard ML , 1990 .

[39]  Robin Milner,et al.  Commentary on standard ML , 1990 .

[40]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[41]  Pierre America,et al.  Denotational Semantics of a Parallel Object-Oriented Language , 1989, Inf. Comput..

[42]  Pierre America,et al.  Solving Reflexive Domain Equations in a Category of Complete Metric Spaces , 1987, J. Comput. Syst. Sci..

[43]  Jan Willem Klop,et al.  The process of De Bakker and Zucker represent bisimulation equivalence classes , 1989 .

[44]  Pierre America,et al.  The practical importance of formal semantics , 1989 .

[45]  A. W. Roscoe,et al.  A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..

[46]  Ernst-Rüdiger Olderog,et al.  Transition Systems, Metric Spaces and Ready Sets in the Semantics of Uniform Concurrency , 1988, J. Comput. Syst. Sci..

[47]  John-Jules Ch. Meyer,et al.  Order and metric in the stream semantics of elemental concurrency , 1987, Acta Informatica.

[48]  Krzysztof R. Apt,et al.  Countable nondeterminism and random assignment , 1986, JACM.

[49]  Pierre America,et al.  Operational semantics of a parallel object-oriented language , 1986, POPL '86.

[50]  Joost N. Kok,et al.  Towards a Uniform Topological Treatment of Streams and Functions on Streams , 1985, ICALP.

[51]  Gerardo Costa,et al.  A Metric Characterization of Fair Computations in CCS , 1985, TAPSOFT, Vol.1.

[52]  Ugo Montanari,et al.  Liveness properties as convergence in metric spaces , 1984, STOC '84.

[53]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[54]  Arie de Bruin.  On the Existence of Cook Semantics , 1984, SIAM J. Comput..

[55]  Jan A. Bergstra,et al.  Linear Time and Branching Time Semantics for Recursion with Merge , 1983, Theor. Comput. Sci..

[56]  William C. Rounds,et al.  Connections Between Two Theories of Concurrency: Metric Spaces and Synchronization Trees , 1983, Inf. Control..

[57]  J. W. de Bakker,et al.  Processes and a Fair Semantics for the Ada Rendez-Vous , 1983, ICALP.

[58]  André Arnold.  Topological Characterizations of Infinite Behaviours of Transition Systems , 1983, ICALP.

[59]  J. W. de Bakker,et al.  Compactness in Semantics for Merge and Fair Merge , 1983, Logic of Programs.

[60]  Ernst-Rüdiger Olderog,et al.  Proof Rules and Transformations Dealing with Fairness , 1983, Sci. Comput. Program..

[61]  Jan A. Bergstra,et al.  A convergence theorem in process algebra , 1982 .

[62]  C. A. R. Hoare.  A Calculus of Total Correctness for Communicating Processes , 1981, Sci. Comput. Program..

[63]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[64]  Frank G. Pagan,et al.  Formal Specification of Programming Languages: A Panoramic Primer , 1981 .

[65]  Maurice Nivat,et al.  Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs , 1980, Theor. Comput. Sci..

[66]  Maurice Nivat,et al.  The metric space of infinite trees. Algebraic and topological properties , 1980, Fundam. Informaticae.

[67]  Robin Milner,et al.  Concurrent Processes and Their Syntax , 1979, JACM.

[68]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[69]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[70]  C. A. R. Hoare,et al.  Ambiguities and insecurities in pascal , 1977, Softw. Pract. Exp..

[71]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[72]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[73]  Peter Wegner,et al.  Operational semantics of programming languages , 1972, Proving Assertions About Programs.

[74]  Christopher Strachey,et al.  Toward a mathematical semantics for computer languages , 1971 .

[75]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

[76]  Robert W. Floyd,et al.  Nondeterministic Algorithms , 1967, JACM.

[77]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[78]  P. Alexandroff.  Über stetige Abbildungen kompakter Räume , 1927 .

[79]  S. Banach.  Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales , 1922 .

[80]  M. Fréchet.  Sur quelques points du calcul fonctionnel , 1906 .

[81]  R. Baire.  Sur la représentation des fonctions discontinues , 1906 .

[82]  John McCarthy,et al.  A basis for a mathematical theory of computation, preliminary report , 1899, IRE-AIEE-ACM '61 (Western).