210 search results - page 2 / 42 » Presenting Functors by Operations and Equations |
POPL
1995
ACM
13 years 9 months ago
1995
ACM
We present a variant of the Standard ML module system rameterized abstract types (i.e. functors returning generative types) map provably equal arguments to compattract types, inst...
ASAP
1997
IEEE
13 years 10 months ago
1997
IEEE
This paper presents a method, based on the formalism of affine recurrence equations, for the synthesis of digital circuits exploiting parallelism at the bit-level. In the initial ...
CTCS
1989
Springer
13 years 10 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
MOC
2010
13 years 1 months ago
2010
A version of the Dynamical Systems Method (DSM) for solving ill-posed nonlinear equations with monotone operators in a Hilbert space is studied in this paper. An a posteriori stopp...
LISP
2008
13 years 6 months ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...