A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract)

DOI10.1007/978-3-540-78499-9_7MaRDI QIDQ5458352zbMATH OpenOpenAlexFDO

Authors Peter Selinger, Benoît Valiron

Publication date 11 April 2008

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78499-9_7

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Categorical logic, topoi (03G30) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• On quantum and probabilistic linear lambda-calculi (extended abstract)
• Categorical models for a semantically linear \(\lambda\)-calculus
• The call-by-value λ-calculus: a semantic investigation
• What is a model for a semantically linear  -calculus?
• scientific article; zbMATH DE number 1942458

Cited in

(8)

• A concrete categorical semantics of lambda-\(\mathcal{S}\)
• On quantum and probabilistic linear lambda-calculi (extended abstract)
• Linearity in the non-deterministic call-by-value setting
• scientific article; zbMATH DE number 1330443 (Why is no real title available?)
• Presheaf models of quantum computation: an outline
• Computational adequacy for substructural lambda calculi
• Enriching a linear/non-linear lambda calculus: a programming language for string diagrams
• Semantics for a lambda calculus for string diagrams

This page was built for publication: A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract)

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