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

DOI10.1007/978-3-030-45231-5_22OpenAlexW3016315428MaRDI QIDQ2200839

James Laird

Publication date: 23 September 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-45231-5_22

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (1)

Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• The lazy lambda calculus in a concurrency scenario
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• A generic type system for the pi-calculus
• Genericity and the \(\pi\)-calculus
• Nominal Sets
• A System-Level Game Semantics
• Curry-style type isomorphisms and game semantics
• Game Semantics for Call-by-Value Polymorphism
• Typed Normal Form Bisimulation
• The Category-Theoretic Solution of Recursive Domain Equations
• Transition systems over games
• Trace semantics for polymorphic references
• Process Types as a Descriptive Tool for Interaction
• A Fully Abstract Trace Semantics for General References
• The single-conclusion proof logic and inference rules specification

This page was built for publication: A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus