A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract)
DOI10.1007/978-3-540-78499-9_7zbMATH Open1138.68351OpenAlexW2114078774MaRDI QIDQ5458352FDOQ5458352
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
Recommendations
Combinatory logic and lambda calculus (03B40) Categorical logic, topoi (03G30) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Cited In (7)
- Linearity in the non-deterministic call-by-value setting
- A concrete categorical semantics of lambda-\(\mathcal{S}\)
- Semantics for a lambda calculus for string diagrams
- Title not available (Why is that?)
- Enriching a linear/non-linear lambda calculus: a programming language for string diagrams
- Presheaf models of quantum computation: an outline
- On quantum and probabilistic linear lambda-calculi (extended abstract)
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)