Call-by-Value Non-determinism in a Linear Logic Type Discipline

DOI10.1007/978-3-642-35722-0_12zbMath1434.68083arXiv1312.4507OpenAlexW3099560079MaRDI QIDQ3455843

Giulio Manzonetto, Michele Pagani, Alejandro Díaz-Caro

Publication date: 11 December 2015

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.4507

zbMATH Keywords

linear logic\(\lambda\)-calculusnondeterminismcall-by-value

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)

Related Items (4)

Tight typings and split bounds, fully developed ⋮ The vectorial \(\lambda\)-calculus ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• A relational semantics for parallelism and non-determinism in a functional setting
• Linear logic
• Filter models for conjunctive-disjunctive \(\lambda\)-calculi
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Lambda-calculi for (strict) parallel functions
• Call-by-name, call-by-value, call-by-need and the linear lambda calculus
• Linearity, Non-determinism and Solvability
• Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
• A General Class of Models of $\mathcal{H}^*$
• A new type assignment for λ-terms
• Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
• The algebraic lambda calculus
• A Filter Model for Concurrent $\lambda$-Calculus

This page was built for publication: Call-by-Value Non-determinism in a Linear Logic Type Discipline