Categories for fixpoint semantics
A precise meaning is given to general recursive definitions of functionals of arbitrarily high type, including non-deterministic definitions. Domain equations involving products, sums, powers and functor domains are solved. The use of categories with ω-colimits as semantic domains is investigated an...
Main Author: | Lehmann, Daniel |
---|---|
Published: |
University of Warwick
1976
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.595737 |
Similar Items
-
Some results on circuit depth
by: McColl, William Finlay
Published: (1976) -
Formal verification techniques using quantum process calculus
by: Davidson, Timothy A. S.
Published: (2012) -
Approximation algorithms for geometric, caching and scheduling problems
by: Adamaszek, Anna
Published: (2012) -
Performance engineering unstructured mesh, geometric multigrid codes
by: Bunt, Richard A.
Published: (2016) -
Modal and fixpoint linear logic.
by: Martin, Alan J.
Published: (2009)