Curry-style type isomorphisms and game semantics

DOI10.1017/S0960129508006828zbMath1160.03008OpenAlexW2952354821MaRDI QIDQ3520148

Joachim de Lataillade

Publication date: 15 August 2008

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129508006828

zbMATH Keywords

game semanticsSystem Ftype isomorphisms

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40)

Related Items (1)

A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus

Cites Work

• Formal parametric polymorphism
• Full abstraction for idealized Algol with passive expressions
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF

This page was built for publication: Curry-style type isomorphisms and game semantics