M. Basaldella & K. Terui (2010):
Infinitary Completeness in Ludics.
In: Proceedings of LICS 2010,
pp. 294–303,
doi:10.1109/LICS.2010.47.
M. Coppo (1998):
Recursive Types: the syntactic and semantic approaches.
In: Type Theory and its Application to Computer Systems,
RIMS Lecture Notes 1023.
RIMS, Kyoto University,
pp. 16–41.
Available at http://hdl.handle.net/2433/61723.
B. Courcelle (1983):
Fundamental properties of infinite trees.
Theor. Comput. Sci. 25,
pp. 95–169,
doi:10.1016/0304-3975(83)90059-2.
J.-Y. Girard (1987):
Proof Theory and Logical Complexity: Volume I.
Bibliopolis,
Napoli.
J.-Y. Girard (2001):
Locus Solum: From the rules of logic to the logic of rules.
Mathematical Structures in Computer Science 11(3),
pp. 301–506,
doi:10.1017/S096012950100336X.
Z. Manna (1974):
Mathematical Theory of Computation.
McGraw–Hill,
New York.
P.-A. Melliès & J. Vouillon (2005):
Recursive polymorphic types and parametricity in an operational framework.
In: Proceedings of LICS 2005,
pp. 82–91,
doi:10.1109/LICS.2005.42.
W.W. Tait (1968):
Normal derivability in classical logic.
In: The Syntax and Semantics of Infinitary Languages, chapter 12,
LNM 72.
Springer–Verlag,
pp. 204–236,
doi:10.1007/BFb0079691.
eptcs@eptcs.org