Personal tools
You are here: Home Events Abstract Archives 2000 Minimisation vs. recursion in higher types

Minimisation vs. recursion in higher types

Ulrich Berger University of Wales, Swansea 4pm Friday 4 February 2000 Room 2511, JCMB, King's Buildings

The abstract functional language mu-PCF is obtained from Plotkin's PCF by removing all fixed point operators and adding instead the constants

R:nat->(nat->nat->nat)->nat->nat, mu:(nat->bool)->nat

for primitive recursion and minimisation respectively. In the talk we compare the set of functionals definable in PCF and mu-PCF (and variations thereof) in the model of partial continuous functionals.

Document Actions