Linearity, non-determinism and solvability

DOI10.3233/FI-2010-324MaRDI QIDQ3000282zbMATH OpenOpenAlexFDO

Authors Michele Pagani, Simona Ronchi Della Rocca

Publication date 18 May 2011

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2010-324

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• Solvability in resource lambda-calculus
• Standardization in resource \(\lambda\)-calculus
• A Semantical and Operational Account of Call-by-Value Solvability
• Call-by-value Solvability
• A semantics for lambda calculi with resources

Cited in

(11)

• scientific article; zbMATH DE number 7559280 (Why is no real title available?)
• Call-by-value non-determinism in a linear logic type discipline
• Extensional proofs in a propositional logic modulo isomorphisms
• Solvability in resource lambda-calculus
• Böhm's theorem for resource lambda calculus through Taylor expansion
• scientific article; zbMATH DE number 65803 (Why is no real title available?)
• Non-deterministic linear hypersubstitutions
• Standardization in resource \(\lambda\)-calculus
• Linear concepts and hidden variables
• Relational graph models at work
• The vectorial \(\lambda\)-calculus

This page was built for publication: Linearity, non-determinism and solvability

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