From Higher Order Terms To Circuits

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)): 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. Bounded fixed points: one can have the flexibility of fixed point definitions and termination at the same time (cf. (Schwichtenberg and Wainer, 1995)). A notion of strict functionals as a tool to prove termination of higher order rewrite systems (cf. (van de Pol and Schwichtenberg, 1995)) .

[1]  Viggo Stoltenberg-Hansen,et al.  Mathematical theory of domains , 1994, Cambridge tracts in theoretical computer science.

[2]  H. Schwichtenberg.  Proofs as programs , 1993 .

[3]  Manfred Broy,et al.  KORSO: Methods, Languages, and Tools for the Construction of Correct Software , 1995, Lecture Notes in Computer Science.

[4]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[5]  Thomas Kropf,et al.  Benchmark-Circuits for Hardware-Verification , 1994, TPCD.

[6]  Helmut Schwichtenberg,et al.  Ordinal Bounds for Programs , 1995 .

[7]  Karl Stroetmann.  Seduct - A Proof Compiler for First Order Logic , 1995, KORSO Book.

[8]  Helmut Schwichtenberg,et al.  Strict Functionals for Termination Proofs , 1995, TLCA.

[9]  Ulrich Berger,et al.  Total Sets and Objects in Domain Theory , 1993, Ann. Pure Appl. Log..

[10]  Ulrich Berger,et al.  An inverse of the evaluation functional for typed lambda -calculus , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[11]  S. Kawasaki,et al.  Springer Verlag, Berlin, Heidelberg, New York (1995) , 1996 .