490 search results - page 46 / 98 » Equivalent Keys of HPC |
ENTCS
2008
13 years 8 months ago
2008
: Countably based filter spaces have been suggested in the 1970's as a model for recursion theory on higher types. Weak limit spaces with a countable base are known to be the ...
ENTCS
2008
13 years 8 months ago
2008
In model-based software development, a complete design and analysis process involves designing the system using the design language, converting it into the analysis language, and ...
ENTCS
2006
13 years 8 months ago
2006
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...
ENTCS
2006
13 years 8 months ago
2006
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,...
ENTCS
2006
13 years 8 months ago
2006
The approaches to automatic formal verification of UML models known up to now require a finite bound on the number of objects existing at each point in time. In [4] we have observ...