Interaction improvement

DOI10.1007/978-3-032-22730-0_18MaRDI QIDQ7317493zbMATH OpenFDO

Authors Adrienne Lancelot, Giulio Manzonetto, Guy McCusker, Gabriele Vanoni

Publication date 24 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-032-22730-0_18

Mathematics Subject Classification ID

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

Cites work

• A category theoretic formulation for Engeler-style models of the untyped -calculus
• A complete normal-form bisimilarity for algebraic effects and handlers
• A complete normal-form bisimilarity for state
• A complete, co-inductive syntactic theory of sequential control and state
• A Powerdomain Construction
• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• Adapting innocent game models for the Böhm tree \(\lambda\)-theory
• Characterization theorems for a filter lambda model
• Effectful normal form bisimulation
• Essential and relational models
• Execution time of λ-terms via denotational semantics and intersection types
• Full abstraction for PCF
• Full abstraction for probabilistic PCF
• Full abstraction in the lazy lambda calculus
• Fully abstract normal form bisimulation for call-by-value pcf
• scientific article; zbMATH DE number 6115908 (Why is no real title available?)
• scientific article; zbMATH DE number 1330448 (Why is no real title available?)
• scientific article; zbMATH DE number 3423547 (Why is no real title available?)
• Improvement theory and its applications
• Innocent game models of untyped -calculus
• Modelling distributed systems.
• Non-idempotent intersection types for the lambda-calculus
• Not Enough Points Is Enough
• On full abstraction for PCF: I, II and III
• Proving congruence of bisimulation in functional programming languages
• Proving soundness of extensional normal-form bisimilarities
• Proving the correctness of recursion-based automatic program transformations
• Relational graph models at work
• Resource-tracking concurrent games
• Slot games: a quantitative model of computation
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• Tight typings and split bounds, fully developed
• Transition systems over games
• Weighted relational models of typed lambda-calculi

This page was built for publication: Interaction improvement

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