Symmetry and Interactivity in Programming

DOI10.2178/bsl/1052669287zbMath1058.03027arXivcs/0501034OpenAlexW2116637840MaRDI QIDQ4650295

Pierre-Louis Curien

Publication date: 9 February 2005

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0501034

zbMATH Keywords

symmetryoperational semanticsproof theoryinteractivitydenotational semanticsludics

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Related Items (1)

Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage

Cites Work

• Unnamed Item
• Linear logic
• Sequential algorithms on concrete data structures
• Fully abstract models of typed \(\lambda\)-calculi
• New foundations for the geometry of interaction
• Fully abstract semantics for observably sequential languages
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• A semantics of evidence for classical arithmetic

This page was built for publication: Symmetry and Interactivity in Programming