Results 1 
3 of
3
Graphbased logic and sketches I: The general framework. Available by web browser from http://www.cwru.edu/1/class/mans/math/pub/wells
, 1996
"... Sketches as a method of specification of mathematical structures are an alternative to the stringbased specification employed in mathematical logic. ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
Sketches as a method of specification of mathematical structures are an alternative to the stringbased specification employed in mathematical logic.
Developing Theories of Types and Computability
, 1999
"... Introduction Domain Theory, type theory (both in the style of MartinLof [40, 41] and in the polymorphic style of Girard/Reynolds [23, 56]), and topos theory (both in the topological/sheaftheoretic treatments and in the realizability approach going back to the early work of Kleene) have attempted ..."
Abstract
 Add to MetaCart
Introduction Domain Theory, type theory (both in the style of MartinLof [40, 41] and in the polymorphic style of Girard/Reynolds [23, 56]), and topos theory (both in the topological/sheaftheoretic treatments and in the realizability approach going back to the early work of Kleene) have attempted to improve on set theory by providing a large suite of closure conditions on domains/types/objects as well as a farreaching logic of properties emphasizing the computable/constructive aspects of the definitions and qualities of functions. Scott's domain theory, (and the many variations proposed and studied; see [2] and [75] for recent introductions with references) has been especially successful in allowing for recursive definitions of types (i.e., solutions to domain equations) but at the expense of introducing a complex structure of "partial elements" in order to have solutions to fixedpoint equations in the domains. Moreover, the topological and e