BibTeX
@MISC{Schwichtenberg_fromhigher,
author = {Helmut Schwichtenberg and Karl Stroetmann},
title = {From Higher Order Terms To Circuits},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
INTRODUCTION In his lecture at the congress, the first author gave a survey on some recent results relevant for computability theory in the context of partial continuous functionals (cf. (Scott, 1982; Ershov, 1977; Stoltenberg-Hansen et al., 1994)): ffl An abstract definition of totality due to Berger (cf. (Berger, 1990; Berger, 1993) and (Stoltenberg-Hansen et al., 1994, Ch. 8.3)), and applications concerning density and effective density theorems. ffl Bounded fixed points: one can have the flexibility of fixed point definitions and termination at the same time (cf. (Schwichtenberg and Wainer, 1995)). ffl A notion of strict functionals as a tool to prove termination of higher order rewrite systems (cf. (van de Pol and Schwichtenberg, 1995)). Since this work is published already, we do not give details here but rather concentrate on another "appli
Citations
| 249 | Domains for Denotational Semantics - Scott - 1982 |
| 85 | Why higher-order logic is a good formalism for specifying and verifying hardware - Gordon - 1985 |
| 50 | An inverse of the evaluation functional for typed -calculus - Berger, Schwichtenberg - 1991 |
| 31 | Total sets and objects in domain theory - Berger - 1993 |
| 28 | Mathematical theory of domains. Cambridge Tracts - Stoltenberg-Hansen, Lindström, et al. - 1994 |
| 25 | Model C of partial continuous functionals - Ershov - 1977 |
| 19 | Totale Objekte und Mengen in der Bereichstheorie - Berger - 1990 |
| 9 | Proofs as programs - Schwichtenberg - 1990 |
| 8 | Ordinal bounds for programs - Schwichtenberg, Wainer - 1995 |
| 6 | Benchmark-Circuits for Hardware-Verification - Kropf - 1994 |
| 1 | SEDUCT --- a proof compiler for first order logic - Stroetmann - 1995 |
