As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Berger [2] observed that the well-known linear list reversal algorithm can be obtained as the computational content of a weak (or “classical”) existence proof. The necessary tools are a refinement [3] of the Dragalin/Friedman [4,5] A-translation, and uniform (or “non-computational”) quantifiers [1]. Both tools are implemented in the Minlog proof assistant (www.minlog-system.de), in addition to the more standard realizability interpretation. The aim of the present paper is to give an introduction into the theory underlying these tools, and to explain their usage in Minlog, using list reversal as a running example.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.