Curry-style type isomorphisms and game semantics

DOI10.1017/S0960129508006828MaRDI QIDQ3520148zbMATHOpenAlexFDO

Authors 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

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

Recommendations

• Second-order type isomorphisms through game semantics
• Isomorphisms of types in the presence of higher-order references
• Classical isomorphisms of types
• On isomorphisms of intersection types
• On Isomorphisms of Intersection Types

Cites work

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

Cited in

(7)

• A short note on type-inhabitation: formula-trees vs. game semantics
• A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus
• Second-order type isomorphisms through game semantics
• Two-Level Game Semantics, Intersection Types, and Recursion Schemes
• scientific article; zbMATH DE number 1342285 (Why is no real title available?)
• Existential type systems between Church and Curry style (type-free style)
• An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520148)