Sciweavers

7 search results - page 1 / 2
» The Bicategory-Theoretic Solution of Recursive Domain Equati...
Sort
View
ENTCS
2007
108views more  ENTCS 2007»
13 years 4 months ago
The Bicategory-Theoretic Solution of Recursive Domain Equations
We generalise the traditional approach of Smyth and Plotkin to the solution of recursive domain equations from order-enriched structures to bicategorical ones and thereby develop ...
Gian Luca Cattani, Marcelo P. Fiore
TPHOL
2009
IEEE
13 years 11 months ago
Some Domain Theory and Denotational Semantics in Coq
Abstract. We present a Coq formalization of constructive ω-cpos (extending earlier work by Paulin-Mohring) up to and including the inverselimit construction of solutions to mixed-...
Nick Benton, Andrew Kennedy, Carsten Varming
DAGSTUHL
2006
13 years 6 months ago
A convenient category of domains
We motivate and define a category of topological domains, whose objects are certain topological spaces, generalising the usual -continuous dcppos of domain theory. Our category su...
Ingo Battenfeld, Matthias Schröder, Alex Simp...
LICS
2002
IEEE
13 years 9 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
ENTCS
2006
153views more  ENTCS 2006»
13 years 4 months ago
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
Lars Birkedal, Rasmus Ejlers Møgelberg, Ras...