The resource lambda calculus is short-sighted in its relational model

DOI10.1007/978-3-642-38946-7_9MaRDI QIDQ5300896zbMATH OpenOpenAlexFDO

Authors Flavien Breuvart

Publication date 28 June 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38946-7_9

zbMATH Keywords

full abstractionlinear logicnondeterminismresource \(\lambda \)-calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Recommendations

• Full abstraction for resource calculus with tests
• Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion
• A semantics for lambda calculi with resources
• Categorical models for simply typed resource calculi
• What is a categorical model of the differential and the resource \(\lambda \)-calculi?

Cited in

(8)

• Full abstraction for resource calculus with tests
• Exponentials with infinite multiplicities
• Resource combinatory algebras
• Relational graph models at work
• scientific article; zbMATH DE number 1424038 (Why is no real title available?)
• Quantitative semantics of the lambda calculus. Some generalisations of the relational model
• Weighted relational models of typed lambda-calculi
• A survey of categorical properties of \(\mathbb{L}\)-fuzzy relations

This page was built for publication: The resource lambda calculus is short-sighted in its relational model

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