Search results for "CPOs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
60	Ying Jiang, Guo-Qiang Zhang 0001	Weakly distributive domains (II).	Frontiers Comput. Sci. China	2007	DBLP DOI BibTeX RDF	weakly distributive domain, stable bifinite domain, meet-cpo, stable function, cartesian closed category
60	Ying Jiang, Guo-Qiang Zhang 0001	Weakly Distributive Domains.	TLCA	2007	DBLP DOI BibTeX RDF
60	Hilary A. Priestley	Ordered Sets and Complete Lattices.	Algebraic and Coalgebraic Methods in the Mathematics of Program Construction	2000	DBLP DOI BibTeX RDF
56	Joaquim Gabarró, Alan Stewart, Maurice Clint, Eamonn Boyle, Isabel Vallejo	Computational Models for Web- and Grid-Based Computation.	Euro-Par	2003	DBLP DOI BibTeX RDF	CPOs, Web and Grid computation, co-algorithms, approximations, UNITY
40	Jean Goubault-Larrecq	Prevision Domains and Convex Powercones.	FoSSaCS	2008	DBLP DOI BibTeX RDF
32	Thanos Rammos, Felix-Sebastian Schilling	Die gemeinsame Verantwortlichkeit in der E-Mobility-Branche - Datenschutz an der Ladesäule - Besonderheiten und Spannungsverhältnisse beim Zusammenspiel von CPOs, EMSPs & Co.	Comput. und Recht	2021	DBLP DOI BibTeX RDF
32	Andre Kornell, Bert Lindenhovius, Michael W. Mislove	Quantum CPOs.	QPL	2020	DBLP DOI BibTeX RDF
32	Zeinab Karake Shalhoub	Analysis of industry-specific concentration of CPOs in Fortune 500 companies.	Commun. ACM	2009	DBLP DOI BibTeX RDF
32	Göran Hamrin, Viggo Stoltenberg-Hansen	Two categories of effective continuous cpos.	Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
32	Michael W. Mislove	Local Dcpos, Local Cpos and Local Completions.	MFPS	1999	DBLP DOI BibTeX RDF
32	Francesco Ranzato	Closures on CPOs Form Complete Lattices.	Inf. Comput.	1999	DBLP DOI BibTeX RDF
32	Francesco Ranzato	CPOs as Concrete Domains: Lattices of Abstract Domains and Complements.	APPIA-GULP-PRODE	1999	DBLP BibTeX RDF
32	Marcelo P. Fiore, Giuseppe Rosolini	The category of cpos from a synthetic viewpoint.	MFPS	1997	DBLP DOI BibTeX RDF
32	Michael Makkai, Giuseppe Rosolini	Studying repleteness in the category of cpos.	MFPS	1997	DBLP DOI BibTeX RDF
32	Alex K. Simpson	The Convex Powerdomain in a Category of Posets Realized by CPOs.	Category Theory and Computer Science	1995	DBLP DOI BibTeX RDF
32	François Lamarche	From Chu Spaces to Cpos.	Theory and Formal Methods	1994	DBLP BibTeX RDF
32	Reinhold Heckmann	Lower and Upper Power Domain Constructions Commute on all Cpos.	Inf. Process. Lett.	1991	DBLP DOI BibTeX RDF
32	Achim Jung	Cartesian Closed Categories of Algebraic CPOs.	Theor. Comput. Sci.	1990	DBLP DOI BibTeX RDF
32	Austin Melton	Topological Spaces for Cpos.	Categorial Methods in Computer Science	1988	DBLP DOI BibTeX RDF
32	Austin Melton, David A. Schmidt	A Topological Framework of cpos Lacking Bottom Elements.	Mathematical Foundations of Programming Semantics	1985	DBLP DOI BibTeX RDF
20	Nick Benton, Andrew Kennedy, Carsten Varming	Some Domain Theory and Denotational Semantics in Coq.	TPHOLs	2009	DBLP DOI BibTeX RDF
20	Paul Blain Levy	Call-by-push-value: Decomposing call-by-value and call-by-name.	High. Order Symb. Comput.	2006	DBLP DOI BibTeX RDF	Call-by-push-value, Call-by-name, Lambda-calculus, Monad, Computational effect, Call-by-value
20	Meng Yang 0013, Lingli Wang, A. E. A. Almaini	Fast Conversion for Large Canonical OR-Coincidence Functions.	APCCAS	2006	DBLP DOI BibTeX RDF
20	Nick Benton, Benjamin Leperchey	Relational Reasoning in a Nominal Semantics for Storage.	TLCA	2005	DBLP DOI BibTeX RDF
20	Octavian Udrea, Yu Deng 0004, Edward Hung, V. S. Subrahmanian	Probabilistic Ontologies and Relational Databases.	OTM Conferences (1)	2005	DBLP DOI BibTeX RDF
20	James Laird	Bistability: An Extensional Characterization of Sequentiality.	CSL	2003	DBLP DOI BibTeX RDF
20	Bernhard Möller	Idel Stream Algebra.	Prospects for Hardware Foundations	1998	DBLP DOI BibTeX RDF
20	Georg Karner	A Topology for Complete Semirings.	STACS	1994	DBLP DOI BibTeX RDF
20	Sten Agerholm	Domain Theory in HOL.	HUG	1993	DBLP DOI BibTeX RDF
20	Guo-Qiang Zhang 0001	Disjunctive Systems and L-Domains.	ICALP	1992	DBLP DOI BibTeX RDF
20	Kurt Sieber	Relating Full Abstraction Results for Different Programming Languages.	FSTTCS	1990	DBLP DOI BibTeX RDF
20	Roger L. Norton	Information systems as implementations (abstract only).	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF
20	Michael G. Main	Free Constructions of Powerdomains.	Mathematical Foundations of Programming Semantics	1985	DBLP DOI BibTeX RDF
20	Ketan Mulmuley	The Mechanization of Existence Proofs of Recursive Predicates.	CADE	1984	DBLP DOI BibTeX RDF