A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
On the Ubiquity of Certain Total Type Structures(Extended Abstract)
2004
Electronical Notes in Theoretical Computer Science
We consider a simple and well-known category of alternating games (also known as sequential data structures) and several categories derived from it. In each case, we present an extension of Plotkin's language FPC (or a suitable linearization thereof) which defines all computable strategies of appropriate types. The quest for such languages results in a novel selection of language primitives for state encapsulation, coroutining and backtracking.
doi:10.1016/s1571-0661(04)05085-6
fatcat:gsykszwdmnaehmezpisla3btbq