Domain Theory in Logical Form
暂无分享,去创建一个
[1] Mariangiola Dezani-Ciancaglini,et al. A filter lambda model and the completeness of type assignment , 1983, Journal of Symbolic Logic.
[2] Alonzo Church,et al. Review: M. H. Stone, The theory of Representations for Boolean Algebras , 1936 .
[3] Dana S. Scott,et al. Lambda Calculus: Some Models, Some Philosophy , 1980 .
[4] M. Barr,et al. Toposes, Triples and Theories , 1984 .
[5] M. Nivat. Fiftieth volume of theoretical computer science , 1988 .
[6] Carl A. Gunter. The Largest First-Order-Axiomatizable Cartesian Closed Category of Domains , 1986, LICS.
[7] J. Lambek,et al. Introduction to higher order categorical logic , 1986 .
[8] Alan Mycroft,et al. Abstract interpretation and optimising transformations for applicative programs , 1982 .
[9] Flemming Nielson,et al. Abstract interpretation using domain theory , 1984 .
[10] Chen C. Chang,et al. Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .
[11] Robin Milner,et al. Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..
[12] K. Hofmann,et al. A Compendium of Continuous Lattices , 1980 .
[13] Joseph E. Stoy,et al. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .
[14] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .
[15] Yu. L. Ershov. Computable functionals of finite types , 1972 .
[16] C. A. R. Hoare,et al. An axiomatic basis for computer programming , 1969, CACM.
[17] Colin Stirling,et al. Modal Logics for Communicating Systems , 1987, Theor. Comput. Sci..
[18] Christopher Strachey,et al. A theory of programming language semantics , 1976 .
[19] F. William Lawvere,et al. Metric spaces, generalized logic, and closed categories , 1973 .
[20] Gordon D. Plotkin,et al. A Powerdomain for Countable Non-Determinism (Extended Abstract) , 1982, ICALP.
[21] Dana S. Scott,et al. Some Domain Theory and Denotational Semantics in Coq , 2009, TPHOLs.
[22] Matthew Hennessy,et al. Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.
[23] Dexter Kozen,et al. A probabilistic PDL , 1983, J. Comput. Syst. Sci..
[24] Gerard Berry,et al. Theory and practice of sequential algorithms: the kernel of the applicative language CDS , 1986 .
[25] P. Martin-Löf. Notes on constructive mathematics , 1970 .
[26] A. Pitts. INTRODUCTION TO HIGHER ORDER CATEGORICAL LOGIC (Cambridge Studies in Advanced Mathematics 7) , 1987 .
[27] Edmund Robinson,et al. Logical Aspects of Denotational Semantics , 1987, Category Theory and Computer Science.
[28] J. M. E. Hyland,et al. Function spaces in the category of locales , 1981 .
[29] Samson Abramsky,et al. On Semantic Foundations for Applicative Multiprogramming , 1983, ICALP.
[30] Dana S. Scott,et al. Data Types as Lattices , 1976, SIAM J. Comput..
[31] M. Dezani-Ciancaglini,et al. Extended Type Structures and Filter Lambda Models , 1984 .
[32] Carl A. Gunter. Universal Profinite Domains , 1987, Inf. Comput..
[33] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..
[34] C. Pollard,et al. Center for the Study of Language and Information , 2022 .
[35] David Harel,et al. First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.
[36] Peter Aczel,et al. An Introduction to Inductive Definitions , 1977 .
[37] Dana S. Scott,et al. Lectures on a Mathematical Theory of Computation , 1982 .
[38] Michael B. Smyth,et al. Power Domains and Predicate Transformers: A Topological View , 1983, ICALP.
[39] Dexter Kozen,et al. On the Duality of Dynamic Algebras and Kripke Models , 1979, Logic of Programs.
[40] Axel Poigné,et al. On Specifications, Theories, and Models with Higher Types , 1986, Inf. Control..
[41] Michael J. C. Gordon,et al. The Denotational Description of Programming Languages , 1979, Springer New York.
[42] Chris Hankin,et al. Abstract Interpretation of Declarative Languages , 1987 .
[43] Nielson Flemming,et al. Abstract interpretation using domain theory , 1984 .
[44] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[45] Jean-Jacques Lévy,et al. Full abstraction for sequential languages : The states of the art , 1983 .
[46] Gordon Plotkin,et al. A framework for intuitionistic modal logics: extended abstract , 1986 .
[47] Robin Milner,et al. Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..
[48] Robert L. Constable,et al. Computability concepts for programming language semantics , 1975, Theor. Comput. Sci..
[49] Fred Kröger,et al. Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.
[50] Gordon D. Plotkin,et al. The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[51] Axel Poigné,et al. Foundations are Rich Institutions, but Institutions are Poor Foundations , 1988, Categorial Methods in Computer Science.
[52] Carl A. Gunter. Profinite Solutions For Recursive Domain Equations , 1985 .
[53] Akira Kanda,et al. Fully Effective Solutions of Recursive Domain Equations , 1979, MFCS.
[54] Gordon D. Plotkin,et al. A Powerdomain Construction , 1976, SIAM J. Comput..
[55] Robert I. Soare. Fundamentals of Recursively Enumerable Sets and the Recursion Theorem , 1987 .
[56] Dexter Kozen,et al. A Representation Theorem for Models of *-Free PDL , 1980, ICALP.
[57] Robin Milner,et al. Principal type-schemes for functional programs , 1982, POPL '82.
[58] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.
[59] Gordon D. Plotkin,et al. A Framework for Intuitionistic Modal Logics , 1988, TARK.
[60] J. W. de Bakker,et al. Mathematical theory of program correctness , 1980, Prentice-Hall international series in computer science.
[61] Stephen G. Matthews. Metric domains for completeness , 1985 .
[62] Michael B. Smyth,et al. The Largest Cartesian Closed Category of Domains , 1983, Theor. Comput. Sci..
[63] Glynn Winskel,et al. Using Information Systems to Solve Recursive Domain Equations Effectively , 1984, Semantics of Data Types.
[64] R. Soare. Recursively enumerable sets and degrees , 1987 .
[65] J. W. de Bakker,et al. Processes and the Denotational Semantics of Concurrency , 1982, Inf. Control..
[66] Robin Milner,et al. Algebraic laws for nondeterminism and concurrency , 1985, JACM.
[67] S. Lane. Categories for the Working Mathematician , 1971 .
[68] Michael B. Smyth,et al. Effectively given Domains , 1977, Theor. Comput. Sci..
[69] Jon Barwise,et al. An Introduction to First-Order Logic , 1977 .
[70] M. Stone. The theory of representations for Boolean algebras , 1936 .
[71] Glynn Winskel,et al. Events in computation , 1980 .
[72] Dana S. Scott,et al. Outline of a Mathematical Theory of Computation , 1970 .